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
TL;DR: A deterministic automaton recognizing a given ω -regular language is constructed from an ω-regular expression with the help of derivatives.
Abstract: A deterministic automaton recognizing a given ω -regular language is constructed from an ω -regular expression with the help of derivatives. The construction is related to Safra's algorithm, in about the same way as the classical derivative method is related to the subset construction.
5 citations
TL;DR: Every ultimate definite automaton A is shown to have the latter property; and a characterization is obtained for all tapes which bring A to a known state by applying a predetermined tape.
Abstract: Let s and t be states of a finite (deterministic) automaton A. t can be reached from s if there is a tape x such that, if A is in state s and receives x, A goes to state t.We consider (1) automata in which the initial state can be reached from any final state, and (2) automata which can be brought to a known state from any unknown state by applying a predetermined tape x.Necessary and sufficient conditions for an ultimate definite automaton to have the former property are obtained. Every ultimate definite automaton A is shown to have the latter property; and a characterization is obtained for all tapes which bring A to a known state. Finally, those ultimate definite automata having the former property are shown to be precisely those which can be brought to the start state from any state by some tape x.
5 citations
01 Oct 2001
TL;DR: Hazard Algebras (Extended Abstract) (J Brzozowski & Z Esik) Undecidability and Incompleteness Results in Automata Theory (J Hartmanis)
Abstract: Hazard Algebras (Extended Abstract) (J Brzozowski & Z Esik) Undecidability and Incompleteness Results in Automata Theory (J Hartmanis) Automata Theory: Its Past and Future (J Hopcroft) Forty Years of Formal Power Series in Automata Theory (W Kuich) Playing Infinite Games in Finite Time (R McNaughton) Gene Assembly in Ciliates: Computing by Folding and Recombination (G Rozenberg) Compositions over a Finite Domain: From Completeness to Synchronizable Automata (A Salomaa).
5 citations
TL;DR: A characterisation of bisimilarity of states of automata in terms of languages and a method to minimise non-deterministic automata with respect to bisimilarities of states are obtained, which confirms that languages can be considered as the natural objects to describe the behaviour of Automata.
5 citations
TL;DR: It is constructively show that if A is a finite automaton satisfying Letichevsky's criterion, then any finite automata can be homomorphically represented by a homomorphic image of a subautomaton of (i.e. is a letter-to-letter [length-preserving] divisor of) a primitive product of copies of A.
5 citations