AbstractIn [7], Séébold (1998) announced that Sturmian words generated by morphisms are all rigid. There was a gap in the proof. This gap is corrected here to complete a combinatorial proof of this result
AbstractRecall that a semigroup has the property Pn∗ if for any sequence of n of its elements, two d...
Among Sturmian words, some of them are morphic, i.e. fixed point of a non-identical morphism on wor...
AbstractA return word of a factor of a Sturmian word starts at an occurrence of that factor and ends...
AbstractIn [7], Séébold (1998) announced that Sturmian words generated by morphisms are all rigid. T...
AbstractUsing the notions of conjugacy of morphisms and of morphisms preserving Lyndon words, we ans...
AbstractWe give a characterization of morphisms which preserve finite and infinite standard Sturmian...
AbstractMárton Kósa (1987) has stated five conjectures devoted to the study of some binary morphisms...
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...
AbstractWe characterize all quasiperiodic Sturmian words: A Sturmian word is not quasiperiodic if an...
We describe an algorithm which, given a factor of a Sturmian word, computes the next factor of the s...
An infinite word generated by a substitution is rigid if all the substitutions which fix this word a...
AbstractWe describe an algorithm which, given a factor of a Sturmian word, computes the next factor ...
AbstractEpisturmian morphisms generalize Sturmian morphisms. Here, we study some intrinsic propertie...
AbstractWe prove some new results concerning the structure, the combinatorics and the arithmetics of...
AbstractRecall that a semigroup has the property Pn∗ if for any sequence of n of its elements, two d...
Among Sturmian words, some of them are morphic, i.e. fixed point of a non-identical morphism on wor...
AbstractA return word of a factor of a Sturmian word starts at an occurrence of that factor and ends...
AbstractIn [7], Séébold (1998) announced that Sturmian words generated by morphisms are all rigid. T...
AbstractUsing the notions of conjugacy of morphisms and of morphisms preserving Lyndon words, we ans...
AbstractWe give a characterization of morphisms which preserve finite and infinite standard Sturmian...
AbstractMárton Kósa (1987) has stated five conjectures devoted to the study of some binary morphisms...
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...
AbstractWe characterize all quasiperiodic Sturmian words: A Sturmian word is not quasiperiodic if an...
We describe an algorithm which, given a factor of a Sturmian word, computes the next factor of the s...
An infinite word generated by a substitution is rigid if all the substitutions which fix this word a...
AbstractWe describe an algorithm which, given a factor of a Sturmian word, computes the next factor ...
AbstractEpisturmian morphisms generalize Sturmian morphisms. Here, we study some intrinsic propertie...
AbstractWe prove some new results concerning the structure, the combinatorics and the arithmetics of...
AbstractRecall that a semigroup has the property Pn∗ if for any sequence of n of its elements, two d...
Among Sturmian words, some of them are morphic, i.e. fixed point of a non-identical morphism on wor...
AbstractA return word of a factor of a Sturmian word starts at an occurrence of that factor and ends...
DOI
Add to ORKG