an:00556376
Zbl 0797.11029
Mignosi, Filippo; S????bold, Patrice
Sturmian morphisms and Rauzy's rules
FR
J. Th??or. Nombres Bordx. 5, No. 2, 221-233 (1993).
00018911
1993
j
11B85 20M05 68R15
infinite binary word; Sturmian words; Sturmian morphisms
An infinite word \(x\) over a binary alphabet \(A\) is called Sturmian if it has exactly \(n+1\) distinct factors of length \(n\) for every \(n \in \mathbb{N}\). A morphism of the free monoid of all the words over \(A\) is called Sturmian if it preserves Sturmian words over \(A\). The authors, extending an earlier sufficient condition by \textit{M??rton K??sa} [Problems and solutions sections of EATCS Bull. 32, 331-333 (1987)], give a criterion for Sturmian morphisms in terms of three special morphisms introduced by K??sa. The final two sections of the paper are devoted to morphisms, the definition of which is motivated by a construction due to \textit{G. Rauzy} [Lect. Notes Comput. Sci. 192, 165-171 (1983; Zbl 0613.10044)] and to the proof that infinite words generated by these morphisms are rigid.
??.Porubsk?? (Bratislava)
Zbl 0613.10044