Automates boustrophédon et mots infinis
We show that the \(\omega\)-language accepted by a two-way finite automaton is regular. The result is effective.
scientific article; zbMATH DE number 3911749