Bordered conjugates of words over large alphabets.
Harju, Tero, Nowotka, Dirk (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Harju, Tero, Nowotka, Dirk (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Currie, James D. (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Currie, James D., Rampersad, Narad (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Vaslet, Elise (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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...