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:
Doroslovački, Rade, Marković, Olivera (2000)
Novi Sad Journal of Mathematics
Similarity:
Gao, Zhicheng, MacFie, Andrew, Panario, Daniel (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Doroslovački, Rade, Marković, Olivera (2000)
Novi Sad Journal of Mathematics
Similarity:
Amy Glen, Jacques Justin (2009)
RAIRO - Theoretical Informatics and Applications
Similarity:
In this paper, we survey the rich theory of infinite which generalize to any finite alphabet, in a rather resembling way, the well-known family of on two letters. After recalling definitions and basic properties, we consider that allow for a deeper study of these words. Some properties of factors are described, including factor complexity, palindromes, fractional powers, frequencies, and return words. We also consider lexicographical properties of episturmian words, as well as their...
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...