Fife’s Theorem Revisited
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.
Unable to display preview. Download preview PDF.
- 1.Allouche, J.-P., Currie, J., Shallit, J.: Extremal infinite overlap-free binary words. Electronic J. Combinatorics 5(1), R27 (1998) (electronic), http://www.combinatorics.org/Volume_5/Abstracts/v5i1r27.html
- 3.Berstel, J.: A rewriting of Fife’s theorem about overlap-free words. In: Karhumäki, J., Rozenberg, G., Maurer, H. (eds.) Results and Trends in Theoretical Computer Science. LNCS, vol. 812, pp. 19–29. Springer, Heidelberg (1994)Google Scholar
- 9.Rampersad, N., Shallit, J., Shur, A.: Fife’s theorem for \(7\over 3\)-powers (2011) (preprint) Google Scholar