Extremal infinite overlap-free binary words.
Allouche, Jean-Paul, Currie, James, Shallit, Jeffrey (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Allouche, Jean-Paul, Currie, James, Shallit, Jeffrey (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Currie, James D. (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Tarannikov, Yuriy (2002)
Journal of Integer Sequences [electronic only]
Similarity:
Pascal Ochem (2006)
RAIRO - Theoretical Informatics and Applications
Similarity:
We present an algorithm which produces, in some cases, infinite words avoiding both large fractional repetitions and a given set of finite words. We use this method to show that all the ternary patterns whose avoidability index was left open in Cassaigne's thesis are 2-avoidable. We also prove that there exist exponentially many -free ternary words and -free 4-ary words. Finally we give small morphisms for binary words containing only the squares , 1 and (01)² and for binary words...
Harju, Tero, Nowotka, Dirk (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Currie, James D. (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Aberkane, Ali, Currie, James D. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Shur, Arseny M. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity: