Codeterministic automata on infinite words (Q1061501)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Codeterministic automata on infinite words |
scientific article; zbMATH DE number 3911748
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Codeterministic automata on infinite words |
scientific article; zbMATH DE number 3911748 |
Statements
Codeterministic automata on infinite words (English)
0 references
1985
0 references
It is known that, contrary to the case of finite words, not all sets of infinite words recognizable by a finite automaton (Büchi's condition) can be accepted by a deterministic one. It is proved in this paper that any recognizable set of infinite words can be recognized by some finite codeterministic automaton. Codeterministic automata can be considered as reverse deterministic automata reading an infinite word from infinity to the beginning.
0 references
finite automaton
0 references
recognizable set of infinite words
0 references
