AbstractIn this paper we prove that the set W of α-words over {0,1} coincides with the set of images of 0 under Sturmian morphisms. This gives an alternative approach of generating α-words. For each w ϵ W, a Sturmian solution H of the equation w = H(0) which is a composition of Sturmian morphisms of special forms can be constructed explicitly. In order to demonstrate how results on Sturmian morphic images are reformulated as results on α-words and vice versa, we give a Sturmian proof for the conjugation and reversion theorem of α-words obtained by the present author in an earlier paper
Combinatorics on words plays a fundamental role in various fields of mathematics, not to mention its...
AbstractIn this paper, we give some new characterizations of words which are finite factors of Sturm...
AbstractWe express any general characteristic sturmian word as a unique infinite non-increasing prod...
AbstractIn this paper we prove that the set W of α-words over {0,1} coincides with the set of images...
AbstractMárton Kósa (1987) has stated five conjectures devoted to the study of some binary morphisms...
AbstractWe give a characterization of morphisms which preserve finite and infinite standard Sturmian...
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...
AbstractThis article is concerned with characteristic Sturmian words of slope α and 1−α (denoted by ...
AbstractLet A = a, b be an alphabet. An infinite word on A is Sturmian if it contains exactly n + 1 ...
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...
AbstractA return word of a factor of a Sturmian word starts at an occurrence of that factor and ends...
A word is closed if it contains a proper factor that occurs both as a prefix and as a suffix but doe...
Combinatorics on words plays a fundamental role in various fields of mathematics, not to mention its...
AbstractIn this paper, we give some new characterizations of words which are finite factors of Sturm...
AbstractWe express any general characteristic sturmian word as a unique infinite non-increasing prod...
AbstractIn this paper we prove that the set W of α-words over {0,1} coincides with the set of images...
AbstractMárton Kósa (1987) has stated five conjectures devoted to the study of some binary morphisms...
AbstractWe give a characterization of morphisms which preserve finite and infinite standard Sturmian...
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...
AbstractThis article is concerned with characteristic Sturmian words of slope α and 1−α (denoted by ...
AbstractLet A = a, b be an alphabet. An infinite word on A is Sturmian if it contains exactly n + 1 ...
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...
AbstractA return word of a factor of a Sturmian word starts at an occurrence of that factor and ends...
A word is closed if it contains a proper factor that occurs both as a prefix and as a suffix but doe...
Combinatorics on words plays a fundamental role in various fields of mathematics, not to mention its...
AbstractIn this paper, we give some new characterizations of words which are finite factors of Sturm...
AbstractWe express any general characteristic sturmian word as a unique infinite non-increasing prod...