scispace - formally typeset
Search or ask a question
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
More filters
Journal ArticleDOI
24 Feb 2003
TL;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

Journal ArticleDOI
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

Journal ArticleDOI
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

Journal ArticleDOI
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


Network Information
Related Topics (5)
Time complexity
36K papers, 879.5K citations
88% related
Data structure
28.1K papers, 608.6K citations
83% related
Model checking
16.9K papers, 451.6K citations
83% related
Approximation algorithm
23.9K papers, 654.3K citations
82% related
Petri net
25K papers, 406.9K citations
82% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20238
202219
20201
20191
20185
201748