The minimal density of a letter in an infinite ternary square-free word is .
Tarannikov, Yuriy (2002)
Journal of Integer Sequences [electronic only]
Similarity:
Displaying similar documents to “Improved bounds on the number of ternary square-free words.”
The minimal density of a letter in an infinite ternary square-free word is .
On the entropy and letter frequencies of ternary square-free words.
Richard, Christoph, Grimm, Uwe (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Extremal infinite overlap-free binary words.
Allouche, Jean-Paul, Currie, James, Shallit, Jeffrey (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A generator of morphisms for infinite words
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...
New lower bound on the number of ternary square-free words.
Sun, Xinyu (2003)
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:
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: