For each there is an infinite binary word with critical exponent .
Currie, James D., Rampersad, Narad (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Critical exponents of words over 3 letters.”
For each there is an infinite binary word with critical exponent .
Counting bordered partial words by critical positions.
Allen, Emily, Blanchet-Sadri, F., Byrum, Cameron, Cucuringu, Mihai, Mercaş, Robert (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Least Periods of Factors of Infinite Words
James D. Currie, Kalle Saari (2008)
RAIRO - Theoretical Informatics and Applications
Similarity:
We show that any positive integer is the least period of a factor of the Thue-Morse word. We also characterize the set of least periods of factors of a Sturmian word. In particular, the corresponding set for the Fibonacci word is the set of Fibonacci numbers. As a by-product of our results, we give several new proofs and tightenings of well-known properties of Sturmian words.
There exist binary circular power free words of every length.
Aberkane, Ali, Currie, James D. (2004)
The Electronic Journal of Combinatorics [electronic only]
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...
Directive words of episturmian words : equivalences and normalization
Amy Glen, Florence Levé, Gwénaël Richomme (2009)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Episturmian morphisms constitute a powerful tool to study episturmian words. Indeed, any episturmian word can be infinitely decomposed over the set of pure episturmian morphisms. Thus, an episturmian word can be defined by one of its morphic decompositions or, equivalently, by a certain directive word. Here we characterize pairs of words directing the same episturmian word. We also propose a way to uniquely define any episturmian word through a normalization of its directive words. As...