Skip to main content
Article thumbnail
Location of Repository

Fife's Theorem Revisited

By Jeffrey Shallit

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

Topics: Computer Science - Formal Languages and Automata Theory
Year: 2011
OAI identifier: oai:arXiv.org:1102.3932
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://arxiv.org/abs/1102.3932 (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.