scientific article; zbMATH DE number 3917737

From MaRDI portal
Publication:3692893





[For the entire collection see Zbl 0568.00020.] In a recent paper, \textit{G. Christol}, \textit{T. Kamae}, \textit{M. Mendès- France} and \textit{G. Rauzy} [Bull. Soc. Math. France 108, 401-419 (1980; Zbl 0472.10035)] introduce the following generalized Thue-Morse sequences over two letters a and b. Given a finite word u over \(\{\) 0,1\(\}\), the infinite word u has its i-th letter equal to a or b according to the number of occurrences of u in the binary expansion of i be even or odd. \textit{A. Černý} [Mathematical foundations of computer science, Proc. 11th Symp., Praha/Czech. 1984, Lect. Notes Comput. Sci. 176, 232-239 (1984; Zbl 0556.68042)] has shown that these words do not contain any factor of the form \((xy)^ nx\), with \(n=2^{| u|}\). We considerably strengthen this result, and prove that these words contain no cube expected \(a^ p\) and \(b^ p\), \(p\leq n\).











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3692893)