Aperiodic finite state automaton

An aperiodic finite-state automaton (also called a counter-free automaton) is a finite-state automaton whose transition monoid is aperiodic.

Properties

A regular language is star-free if and only if it is accepted by an automaton with a finite and aperiodic transition monoid. This result of algebraic automata theory is due to Marcel-Paul Schützenberger.^[1] In particular, the minimum automaton of a star-free language is always counter-free (however, a star-free language may also be recognized by other automata that are not aperiodic).

A counter-free language is a regular language for which there is an integer n such that for all words x, y, z and integers m ≥ n we have xy^mz in L if and only if xyⁿz in L. For these languages, when a string contains enough repetitions of any substring (at least n repetitions), changing the number of repetitions to another number that is at least n cannot change membership in the language. (This is automatically true when y is the empty string, but becomes a nontrivial condition when y is non-empty.) Another way to state Schützenberger's theorem is that star-free languages and counter-free languages are the same thing.

An aperiodic automaton satisfies the Černý conjecture.^[2]

References

• McNaughton, Robert; Papert, Seymour (1971). Counter-free Automata. Research Monograph. Vol. 65. With an appendix by William Henneman. MIT Press. ISBN 0-262-13076-9. Zbl 0232.94024.
• Sonal Pratik Patel (2010). An Examination of Counter-Free Automata (PDF) (Masters Thesis). San Diego State University. — An intensive examination of McNaughton, Papert (1971).
• Thomas Colcombet (2011). "Green's Relations and their Use in Automata Theory". In Dediu, Adrian-Horia; Inenaga, Shunsuke; Martín-Vide, Carlos (eds.). Proc. Language and Automata Theory and Applications (LATA) (PDF). LNCS. Vol. 6638. Springer. pp. 1–21. ISBN 978-3-642-21253-6. — Uses Green's relations to prove Schützenberger's and other theorems.