DOIAbstract
AbstractWe characterize all quasiperiodic Sturmian words: A Sturmian word is not quasiperiodic if and only if it is a Lyndon word. Moreover, we study links between Sturmian morphisms and quasiperiodicity
AbstractWe characterize all quasiperiodic Sturmian words: A Sturmian word is not quasiperiodic if and only if it is a Lyndon word. Moreover, we study links between Sturmian morphisms and quasiperiodicity
AbstractIn [7], Séébold (1998) announced that Sturmian words generated by morphisms are all rigid. T...
AbstractAn infinite word x over the alphabet A is Sturmian if and only if gx(n) = n + 1 for any inte...
AbstractWe prove some new results concerning the structure, the combinatorics and the arithmetics of...
AbstractWe characterize all quasiperiodic Sturmian words: A Sturmian word is not quasiperiodic if an...
International audienceWe characterize all quasiperiodic Sturmian words: a Sturmian word is not quasi...
AbstractRecently the second two authors characterized quasiperiodic Sturmian words, proving that a S...
A word is quasiperiodic if it can be obtained by concatenations and overlaps of a smaller word, call...
This overview paper is devoted to Sturmian words. The first part summarizes different characterizati...
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...
We study the notion of quasiperiodicity, introduced by Apostolico and Ehrenfeucht at the beginning o...
AbstractIn this paper, we study word regularities and in particular extensions of the notion of the ...
AbstractNous présentons une nouvelle caractérisation des mots de Sturm basée sur les mots de retour....
AbstractMárton Kósa (1987) has stated five conjectures devoted to the study of some binary morphisms...
Let be a finite alphabet. A word w over is said to be quasiperiodic if it has a finite proper subw...
AbstractIn [7], Séébold (1998) announced that Sturmian words generated by morphisms are all rigid. T...
AbstractAn infinite word x over the alphabet A is Sturmian if and only if gx(n) = n + 1 for any inte...
AbstractWe prove some new results concerning the structure, the combinatorics and the arithmetics of...
AbstractWe characterize all quasiperiodic Sturmian words: A Sturmian word is not quasiperiodic if an...
International audienceWe characterize all quasiperiodic Sturmian words: a Sturmian word is not quasi...
AbstractRecently the second two authors characterized quasiperiodic Sturmian words, proving that a S...
A word is quasiperiodic if it can be obtained by concatenations and overlaps of a smaller word, call...
This overview paper is devoted to Sturmian words. The first part summarizes different characterizati...
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...
We study the notion of quasiperiodicity, introduced by Apostolico and Ehrenfeucht at the beginning o...
AbstractIn this paper, we study word regularities and in particular extensions of the notion of the ...
AbstractNous présentons une nouvelle caractérisation des mots de Sturm basée sur les mots de retour....
AbstractMárton Kósa (1987) has stated five conjectures devoted to the study of some binary morphisms...
Let be a finite alphabet. A word w over is said to be quasiperiodic if it has a finite proper subw...
AbstractIn [7], Séébold (1998) announced that Sturmian words generated by morphisms are all rigid. T...
AbstractAn infinite word x over the alphabet A is Sturmian if and only if gx(n) = n + 1 for any inte...
AbstractWe prove some new results concerning the structure, the combinatorics and the arithmetics of...
Add to ORKG