A one-sided Zimin construction.
Cummings, L.J., Mays, M. (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Improved bounds on the length of maximal abelian square-free words.”
A one-sided Zimin construction.
The number of ternary words avoiding abelian cubes grows exponentially.
Aberkane, Ali, Currie, James D., Rampersad, Narad (2004)
Journal of Integer Sequences [electronic only]
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:
There are ternary circular square-free words of length for 18.
Currie, James D. (2002)
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:
There exist binary circular power free words of every length.
Aberkane, Ali, Currie, James D. (2004)
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:
On ternary square-free circular words.
Shur, Arseny M. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
-words over any alphabet without subword for fixed , and .
Doroslovački, Rade, Marković, Olivera (2000)
Novi Sad Journal of Mathematics
Similarity:
On some problems related to palindrome closure
Michelangelo Bucci, Aldo de Luca, Alessandro De Luca, Luca Q. Zamboni (2008)
RAIRO - Theoretical Informatics and Applications
Similarity:
In this paper, we solve some open problems related to (pseudo)palindrome closure operators and to the infinite words generated by their iteration, that is, standard episturmian and pseudostandard words. We show that if is an involutory antimorphism of , then the right and left -palindromic closures of any factor of a -standard word are also factors of some -standard word. We also introduce the class of pseudostandard words with “seed”, obtained by iterated pseudopalindrome closure...