arXiv Open Access 2011

Fife's Theorem Revisited

Jeffrey Shallit

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.FL

Penulis (1)

Jeffrey Shallit

Format Sitasi

APA MLA BibTeX

Shallit, J. (2011). Fife's Theorem Revisited. https://arxiv.org/abs/1102.3932

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2011
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓