Improved bounds on the length of maximal abelian square-free words.
Bullock, Evan M. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “The number of ternary words avoiding abelian cubes grows exponentially.”
Improved bounds on the length of maximal abelian square-free words.
A one-sided Zimin construction.
Cummings, L.J., Mays, M. (2001)
The Electronic Journal of Combinatorics [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 note on antichains of words.
Currie, James D. (1995)
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:
How many square occurrences must a binary sequence contain?
Kucherov, Gregory, Ochem, Pascal, Rao, Michaël (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The number of positions starting a square in binary words.
Harju, Tero, Kärki, Tomi, Nowotka, Dirk (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Efficient lower bounds on the number of repetition-free words.
Kolpakov, Roman (2007)
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:
There are ternary circular square-free words of length for 18.
Currie, James D. (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The minimal density of a letter in an infinite ternary square-free word is .
Tarannikov, Yuriy (2002)
Journal of Integer Sequences [electronic only]
Similarity:
Binary words avoiding the pattern AABBCABBA
Pascal Ochem (2010)
RAIRO - Theoretical Informatics and Applications
Similarity:
We show that there are three types of infinite words over the two-letter alphabet {0,1} that avoid the pattern . These types, , , and , differ by the factor complexity and the asymptotic frequency of the letter 0. Type has polynomial factor complexity and letter frequency . Type has exponential factor complexity and the frequency of the letter 0 is at least 0.45622 and at most 0.48684. Type is obtained from type ...