Automates boustrophédon et mots infinis (Q1061503)
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: Automates boustrophédon et mots infinis |
scientific article; zbMATH DE number 3911749
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Automates boustrophédon et mots infinis |
scientific article; zbMATH DE number 3911749 |
Statements
Automates boustrophédon et mots infinis (English)
0 references
1985
0 references
We show that the \(\omega\)-language accepted by a two-way finite automaton is regular. The result is effective.
0 references
omega language
0 references
regular language
0 references
two-way finite automaton
0 references
