Jacques Justin, Giuseppe Pirillo (2010)
RAIRO - Theoretical Informatics and Applications
Similarity:
Here we give a characterization of Arnoux–Rauzy sequences by the way of the lexicographic orderings of their alphabet.
Jacques Justin, Giuseppe Pirillo (2002)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Here we give a characterization of Arnoux–Rauzy sequences by the way of the lexicographic orderings of their alphabet.
Paquin, Geneviève, Vuillon, Laurent (2007)
The Electronic Journal of Combinatorics [electronic only]
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...
Filippo Mignosi, Luca Q. Zamboni (2002)
Acta Arithmetica
Similarity:
L'ubomíra Balková, Edita Pelantová, Štěpán Starosta (2011)
RAIRO - Theoretical Informatics and Applications
Similarity:
The properties characterizing Sturmian words are considered for words on multiliteral alphabets. We summarize various generalizations of Sturmian words to multiliteral alphabets and enlarge the list of known relationships among these generalizations. We provide a new equivalent definition of rich words and make use of it in the study of generalizations of Sturmian words based on palindromes. We also collect many examples of infinite words to illustrate differences in the generalized...