Sturmian words: structure, combinatorics, and their arithmetics
Theoretical Computer Science - Special issue: formal language theory
Fine and Wilf's theorem for three periods and a generalization of Sturmian words
Theoretical Computer Science
Palindromes and Sturmian words
Theoretical Computer Science
Sturmian words and words with a critical exponent
Theoretical Computer Science
Fractional powers in Sturmian words
Theoretical Computer Science
Episturmian words and some constructions of de Luca and Rauzy
Theoretical Computer Science
Automata on Infinite Words, Ecole de Printemps d'Informatique Théorique,
Theoretical Computer Science
Conjugacy and episturmian morphisms
Theoretical Computer Science
Inequalities characterizing standard Sturmian and episturmian words
Theoretical Computer Science
Palindromic prefixes and episturmian words
Journal of Combinatorial Theory Series A
Pseudopalindrome closure operators in free monoids
Theoretical Computer Science
Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words
Theoretical Computer Science
Factor versus palindromic complexity of uniformly recurrent infinite words
Theoretical Computer Science
Powers in a class of A-strict standard episturmian words
Theoretical Computer Science
Some properties of the Tribonacci sequence
European Journal of Combinatorics
Characterizations of finite and infinite episturmian words via lexicographic orderings
European Journal of Combinatorics
A characterization of fine words over a finite alphabet
Theoretical Computer Science
On different generalizations of episturmian words
Theoretical Computer Science
On stabilizers of infinite words
Theoretical Computer Science
On a Generalization of Standard Episturmian Morphisms
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Quasiperiodic and Lyndon episturmian words
Theoretical Computer Science
European Journal of Combinatorics
European Journal of Combinatorics
On a Family of Morphic Images of Arnoux-Rauzy Words
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Characteristic morphisms of generalized episturmian words
Theoretical Computer Science
On a generalization of Christoffel words: epichristoffel words
Theoretical Computer Science
Involutions of epicentral words
European Journal of Combinatorics
A local balance property of episturmian words
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Sturmian and episturmian words: a survey of some recent results
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
On the fixed points of the iterated pseudopalindromic closure operator
Theoretical Computer Science
Balancing and clustering of words in the Burrows-Wheeler transform
Theoretical Computer Science
A standard correspondence on epicentral words
European Journal of Combinatorics
A generalized palindromization map in free monoids
Theoretical Computer Science
Introducing privileged words: Privileged complexity of Sturmian words
Theoretical Computer Science
Hi-index | 5.24 |
Infinite episturmian words are a generalization of Sturmian words which includes the Arnoux-Rauzy sequences. We continue their study and that of episturmian morphisms, begun previously, in relation with the action of the shift operator. Palindromic and periodic factors of these words are described. We consider, in particular, the case where these words are generated by morphisms and introduce then a notion of intercept generalizing that of Sturmian words. Finally, we prove that the frequencies of the factors in a strong sense do exist for all episturmian words.