On infinite prefix normal words (Q5919082)

The paper contains a series of results on infinite prefix normal words. In the finite version, prefix normal words were defined by \textit{G. Fici} and \textit{Z. Lipták} [Lect. Notes Comput. Sci. 6795, 228--238 (2011; Zbl 1221.68128)] as binary words with the property that no factor has more \(1\)s than the prefix of the same length. In particular, a Sturmian word is prefix normal if and only if it is \(1c_\alpha\), where \(c_\alpha\) is the characteristic word of slope \(\alpha\). Then the authors define two prefix normal forms of a given infinite word. This nice notion gives a link to abelian complexity and lexicographic order, and allows one to study prefix normal words related to the paperfolding word, the Thue-Morse word and other known examples.