Decimations and sturmian words
Jacques Justin, Giuseppe Pirillo (1997)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Jacques Justin, Giuseppe Pirillo (1997)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
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...
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.
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...