Lyndon factorization of the Thue-Morse word and its relatives.
Ido, Augustin, Melançon, Guy (1997)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Ido, Augustin, Melançon, Guy (1997)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
C. R. Fletcher (1971)
Publications du Département de mathématiques (Lyon)
Similarity:
W. Narkiewicz (1973)
Colloquium Mathematicae
Similarity:
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...
Amy Glen, Florence Levé, Gwénaël Richomme (2008)
RAIRO - Theoretical Informatics and 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....
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...