Sturmian morphisms and Rauzy's rules (Q1320513)

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.