ω-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.

Array Automata and Array Grammars

Abstract: : Finite automata having two-dimensional tapes are much less well-behaved than their one-dimensional counterparts. In particular, for such automata, one-way is weaker than two-way, array-bounded is weaker than non-array-bounded, and deterministic is weaker than nondeterministic. It also appears to be difficult to define a natural class of array grammars that is equal in power to any of these types of array automata; all of the definitions formulated thus far either have the wrong power or have some degree of artificiality. (Author)

Simple self-reproducing universal automata

Abstract: von Neumann and Thatcher have shown that one may construct self-reproducing universal arrays using as basic cells finite automata with only 29 states. The simplicity of the components necessitates complex programming. We present a self-reproducing universal array with simple programming. This is made possible by using as basic unit a finite automaton which can execute an internal program of up to 20 instructions.

An automata-theoretic approach to reasoning about infinite-state systems

Abstract: We develop an automata-theoretic framework for reasoning about infinite-state sequential systems. Our framework is based on the observation that states of such systems, which carry a finite but unbounded amount of information, can be viewed as nodes in an infinite tree, and transitions between states can be simulated by finite-state automata. Checking that the system satisfies a temporal property can then be done by an alternating two-way tree automaton that navigates through the tree. As has been the case with finite-state systems, the automata-theoretic framework is quite versatile. We demonstrate it by solving several versions of the model-checking problem for μ-calculus specifications and prefix-recognizable systems, and by solving the realizability and synthesis problems for μ-calculus specifications with respect to prefix-recognizable environments.

Quantum Automata with Open Time Evolution

Abstract: In this paper, a model for finite automaton with an open quantum evolution is introduced, and its basic properties are studied. It is shown that the (fuzzy) languages accepted by open evolution quantum automata obey various closure properties. More importantly, it is shown that major other models of finite automata, including probabilistic, measure once quantum, measure many quantum, and Latvian quantum automata can be simulated by the open quantum evolution automata without increasing the number of the states.