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
TL;DR: The Gill and Kou introduced the multiple-entry finite automaton (mefa) with no specified initial state and showed that the class of languages accepted by mefa's is theclass of regular languages closed under suffix, and tried to show that mefa descriptions may be very economical by exhibiting a mefa with n states such that every equivalent dfa has at least 2 n states.

9 citations

Journal ArticleDOI
TL;DR: The block-stochastische Struktur definiert eine Äquivalenzbeziehung zwischen Zuständen des Automaten, especially with respect to the languages accepted in the states of the automata.
Abstract: Finite automata are considered whose transition matrix is blockstochastic. The block-stochastic structure defines an equivalence relation among states of the automata. The implications of this relation are investigated, especially with respect to the languages accepted in the states of the automata.

9 citations

Journal ArticleDOI
TL;DR: This work considers two classes of automata: cyclic automata and Eulerian automata, and studies the computational complexity of the following problems: does there exist a reset word of given length for a given automaton?

9 citations

Journal ArticleDOI
TL;DR: The formalism is used to explore and generalize a relationship recently studied by Ito, indicating a connection to the invariance matrix approach to cellular automata which has been developed by Jen.

9 citations

Journal ArticleDOI
TL;DR: The descriptional complexity of limited automata is investigated and the simulation of k-limited automata over general alphabets by pushdown automata turns out to be an exponential blow-up of the size.
Abstract: A k-limited automaton is a linear bounded automaton that may rewrite each tape cell only in the first k visits, where k ≥ 0 is a fixed constant. It is known that these automata accept context-free languages only. We investigate the descriptional complexity of limited automata. Since the unary languages accepted are necessarily regular, we first study the cost in the number of states when finite automata simulate a unary k-limited automaton. For the conversion of a 4n-state deterministic 1-limited automaton into one-way or two-way deterministic or nondeterministic finite automata, we show a lower bound of n ⋅ F ( n ) states, where F denotes Landau's function. So, even the ability to deterministically rewrite any cell only once gives an enormous descriptional power. For the simulation cost for removing the ability to rewrite each cell k ≥ 1 times, more precisely, the cost for the simulation of sweeping unary k-limited automata by deterministic finite automata, we obtain a lower bound of n ⋅ F ( n ) k . The upper bound of the cost for the simulation by two-way deterministic finite automata is a polynomial whose degree is quadratic in k. If the k-limited automaton is rotating, the upper bound reduces to O ( n k + 1 ) and the lower bound derived is Ω ( n k + 1 ) even for nondeterministic two-way finite automata. So, for rotating k-limited automata, the trade-off for the simulation is tight in the order of magnitude. Finally, we consider the simulation of k-limited automata over general alphabets by pushdown automata. It turns out that the cost is an exponential blow-up of the size. Furthermore, an exponential size is also necessary.

9 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