Abstract
We give another proof of a theorem of Fife - understood broadly as providing a finite automaton that gives a complete description of all infinite binary overlap-free words. Our proof is significantly simpler than those in the literature. As an application we give a complete characterization of the overlap-free words that are 2-automatic. © 2011 Springer-Verlag.
Cite
CITATION STYLE
APA
Shallit, J. (2011). Fife’s theorem revisited. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6795 LNCS, pp. 397–405). https://doi.org/10.1007/978-3-642-22321-1_34
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free