For a givenweighted finite automaton over a strong bimonoid we construct its reducedNerode automaton, which is crisp-deterministic and equivalent to the original weighted automaton with respect to the initial algebra semantics.We show that the reducedNerode automaton is even smaller than theNerode automaton, which was previously used in determinization related to this semantics. We determine ne...

In this paper, we introduce generalized directable fuzzy automaton and discuss their structural characterizations. We have shown that a generalized directable fuzzy automaton is an extension of a uniformly monogenically strongly directable fuzzy automaton by a uniformly monogenically trap-directable fuzzy automaton and obtain other equivalent conditions for a generalized directable fuzzy automa...

½¼ Service Abstract Automaton Concrete Service Auxiliary Automaton Abstract Service Automaton

We consider weighted finite automata over strong bimonoids, where these weight structures can be considered as semirings which might lack distributivity. Then, in general, the well-known run semantics, initial algebra semantics, and transition semantics of an automaton are different. We prove an algebraic characterization for the initial algebra semantics in terms of stable finitely generated s...

The experimental logic of Moore and Mealy type automata is investigated. key words: automaton logic; partition logic; comparison to quantum logic; intrinsic measurements

The concept of an automaton group generalizes easily to semigroups, and the systematic study of this area is beginning. This paper aims to contribute to that study. The basic theory of automaton semigroups is briefly reviewed. Various natural semigroups are shown to arise as automaton semigroups. The interaction of certain semigroup constructions with the class of automaton semigroups is studie...

There exist several methods of computing an automaton recognizing the language denoted by a given regular expression: In the case of words, ones can compute the position automaton P due to Glushkov, the c-continuation automaton C due to Champarnaud and Ziadi, the follow automaton F due to Illie and Yu and the equation automaton E due to Antimirov. It has been shown that P and C are isomorphic a...

The trace automaton appears to be a useful tool in generating partially-ordered test cases for asynchronous systems. We give an EXPSPACE algorithm which constructs the trace automaton from a given set of asynchronous communicating processes. Conclusions: We introduce the notion of trace automaton of a system of asyn-chronously communicating input-output state machines such that the trace automa...

A model of information confrontation based on a two-dimensional percolation-cellular automaton closed oriented surface is constructed and implemented programmatically. Numerical experiments were performed. theorem the finiteness completely positive topological entropy given cellular formulated proved. As an applied application automaton, retrospective forecast results Russian Presidential elect...