Extremal infinite overlap-free binary words.
Allouche, Jean-Paul, Currie, James, Shallit, Jeffrey (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “A generator of morphisms for infinite words”
Extremal infinite overlap-free binary words.
The minimal density of a letter in an infinite ternary square-free word is .
Tarannikov, Yuriy (2002)
Journal of Integer Sequences [electronic only]
Similarity:
On ternary square-free circular words.
Shur, Arseny M. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bordered conjugates of words over large alphabets.
Harju, Tero, Nowotka, Dirk (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Improved bounds on the number of ternary square-free words.
Grimm, Uwe (2001)
Journal of Integer Sequences [electronic only]
Similarity:
Partially abelian squarefree words
Robert Cori, Maria Rosaria Formisano (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A linear-time algorithm to decide whether a binary word contains an overlap
A. J. Kfoury (1988)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: