Among Sturmian words, some of them are morphic, i.e. fixed point of a non-identical morphism on words. Berstel and Séébold (1993) have shown that if a characteristic Sturmian word is morphic, then it can be extended by the left with one or two letters in such a way that it remains morphic and Sturmian. Yasutomi (1997) has proved that these were the sole possible additions and that, if we cut the first letters of such a word, it didn't remain morphic. In this paper, we give an elementary and combinatorial proof of this result
AbstractWe study the simplification of infinite morphic words by using elementary morphisms. In part...
Sturmian words are in nite words over a two-letter alphabet that admit a great number of equivalen...
AbstractIn this paper we prove that the set W of α-words over {0,1} coincides with the set of images...
AbstractAn infinite word x over the alphabet A is Sturmian if and only if gx(n) = n + 1 for any inte...
AbstractIn [7], Séébold (1998) announced that Sturmian words generated by morphisms are all rigid. T...
In this paper, we define (k, l)-Sturmian words. Then, we study their complexity. Finally, we establi...
This overview paper is devoted to Sturmian words. The first part summarizes different characterizati...
AbstractLet A = a, b be an alphabet. An infinite word on A is Sturmian if it contains exactly n + 1 ...
AbstractWe give a characterization of morphisms which preserve finite and infinite standard Sturmian...
Generalizing the notion of the boundary sequence introduced by Chen and Wen, the nth term of the ?-b...
In recent years, combinatorial properties of finite and infinite words have become increasingly impo...
A balanced word is one in which any two factors of the same length contain the same number of each l...
International audienceGiven an infinite word x over an alphabet A, a letter b occurring in x, and a ...
AbstractMárton Kósa (1987) has stated five conjectures devoted to the study of some binary morphisms...
The properties characterizing Sturmian words are considered for words on multiliteral alphabets. We ...
AbstractWe study the simplification of infinite morphic words by using elementary morphisms. In part...
Sturmian words are in nite words over a two-letter alphabet that admit a great number of equivalen...
AbstractIn this paper we prove that the set W of α-words over {0,1} coincides with the set of images...
AbstractAn infinite word x over the alphabet A is Sturmian if and only if gx(n) = n + 1 for any inte...
AbstractIn [7], Séébold (1998) announced that Sturmian words generated by morphisms are all rigid. T...
In this paper, we define (k, l)-Sturmian words. Then, we study their complexity. Finally, we establi...
This overview paper is devoted to Sturmian words. The first part summarizes different characterizati...
AbstractLet A = a, b be an alphabet. An infinite word on A is Sturmian if it contains exactly n + 1 ...
AbstractWe give a characterization of morphisms which preserve finite and infinite standard Sturmian...
Generalizing the notion of the boundary sequence introduced by Chen and Wen, the nth term of the ?-b...
In recent years, combinatorial properties of finite and infinite words have become increasingly impo...
A balanced word is one in which any two factors of the same length contain the same number of each l...
International audienceGiven an infinite word x over an alphabet A, a letter b occurring in x, and a ...
AbstractMárton Kósa (1987) has stated five conjectures devoted to the study of some binary morphisms...
The properties characterizing Sturmian words are considered for words on multiliteral alphabets. We ...
AbstractWe study the simplification of infinite morphic words by using elementary morphisms. In part...
Sturmian words are in nite words over a two-letter alphabet that admit a great number of equivalen...
AbstractIn this paper we prove that the set W of α-words over {0,1} coincides with the set of images...