ω-automaton

About: ω-automaton is a research topic. Over the lifetime, 2299 publications have been published within this topic receiving 68468 citations. The topic is also known as: stream automaton & ω-automata.

On algebraic study of fuzzy automata

Abstract: This paper is towards the characterization of algebraic concepts such as subautomaton, retrievability and connectivity of a fuzzy automaton in terms of its layers, and to associate upper semilattices with fuzzy automata. Meanwhile, we provide a decomposition of a fuzzy automaton in terms of its layers and propose a construction of a fuzzy automaton corresponding to a given finite partially ordered set (poset). Finally, we establish an isomorphism between the poset of class of subautomata of a fuzzy automaton and an upper semilattice.

On the capabilities of grammars, automata, and transducers controlled by monoids

Abstract: During recent decades, classical models in language theory have been extended by control mechanisms defined by monoids. We study which monoids cause the extensions of context-free grammars, finite automata, or finite state transducers to exceed the capacity of the original model. Furthermore, we investigate when, in the extended automata model, the nondeterministic variant differs from the deterministic one in capacity. We show that all these conditions are in fact equivalent and present an algebraic characterization. In particular, the open question of whether every language generated by a valence grammar over a finite monoid is context-free is provided with a positive answer.

Exploiting symmetry in the synthesis of supervisors for discrete event systems

Abstract: In this paper we investigate a method to exploit the symmetry inherent to many systems in order to reduce the computational complexity of the supervisory control problem (SCP). We characterize symmetry using notions of group theory and show that under the condition of existence of a special group of permutations acting on the alphabet of a (regular) language we can define a quotient automaton representation for the language which has, in general, a much smaller state space than its original deterministic, trim and minimal (in number of states) automaton representation. We then propose an algorithm to synthesize a solution to the SCP which is similar to the classical one but performed on reduced automata. Special attention is given to the particular case of systems whose models contain similar components. The approach is illustrated by an example of control of a small production line.

Efficient induction of finite state automata

Abstract: This paper introduces a new algorithm for the induction of complex finite state automata from samples of behaviour. The algorithm is based on information theoretic principles. The algorithm reduces the search space by many orders of magnitude over what was previously thought possible. We compare the algorithm with some existing induction techniques for finite state automata and show that the algorithm is much superior in both run time and quality of inductions.

On the Effectiveness of Evolution Compared to Time-Consuming Full Search of Optimal 6-State Automata

Abstract: The Creature's Exploration Problem is defined for an independent agent on regular grids. This agent shall visit all non-blocked cells in the grid autonomously in shortest time. Such a creature is defined by a specific finite state machine. Literature shows that the optimal 6-state automaton has already been found by simulating all possible automata. This paper tries to answer the question if it is possible to find good or optimal automata by using evolution instead of time-consuming full simulation. We show that it is possible to achieve 80% to 90% of the quality of the best automata with evolution in much shorter time.