Topic
ω-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.
Papers published on a yearly basis
Papers
More filters
••
24 Feb 2003TL;DR: An explicit simulation of 2-way nondeterministic automata by 1-way alternating automata with quadratic blow-up is described.
Abstract: We describe an explicit simulation of 2-way nondeterministic automata by 1-way alternating automata with quadratic blow-up. We first describe the construction for automata on finite words, and extend it to automata on infinite words.
15 citations
••
15 citations
••
TL;DR: An additive weighted finite automaton model is introduced that provides a conceptually simple way to reprove the neighborhood of a regular language with respect to an additive distance and a tight upper bound for the state complexity of the conversion is established.
Abstract: It is known that the neighborhood of a regular language with respect to an additive distance is regular. We introduce an additive weighted finite automaton model that provides a conceptually simple way to reprove this result. We consider the state complexity of converting additive weighted finite automata to deterministic finite automata. As our main result we establish a tight upper bound for the state complexity of the conversion.
15 citations
••
TL;DR: An analog automaton is a finite state automaton where the state is defined in terms of real numbers representing physical quantities such a position, velocity, mass or color.
Abstract: Conway's Lifegame is a trivial and wellknown application of a more general theory called the theory of cellular automata. Complex systems modeling may be based on the theory of cellular automata, originated by John von Neumann. Our approach is to define simple components that we call “analog automata”. An analog automaton is a finite state automaton where the state is defined in terms of real numbers representing physical quantities such a position, velocity, mass or color. Deterministic state transition function are applied to these automata using information from the state of neighboring automata. In our case, successive generations in the evolution of these cellular automata are mapped onto polygonal meshes in order to build and texture arbitrary surfaces.
15 citations
••
TL;DR: A version of the Krohn-Rhodes decomposition theorem for finite automata is proved in which capabilities as well as semigroups are preserved.
Abstract: A version of the Krohn-Rhodes decomposition theorem for finite automata is proved in which capabilities as well as semigroups are preserved. Another elementary proof of the usual Krohn-Rhodes theorem is also presented.
15 citations