Lyndon factorization of generalized words of Thue

Anton Černý (1)

1 Department of Mathematics and Computer Science [Kuwait]

The i-th symbol of the well-known infinite word of Thue on the alphabet \ 0,1\ can be characterized as the parity of the number of occurrences of the digit 1 in the binary notation of i. Generalized words of Thue are based on counting the parity of occurrences of an arbitrary word w∈\ 0,1\^+-0^* in the binary notation of i. We provide here the standard Lyndon factorization of some subclasses of this class of infinite words.

Mots clés: Lyndon word; Lyndon factorization; automatic sequence

Domaines: Mathématique discrète [cs.DM]

Anton Černý. Lyndon factorization of generalized words of Thue. Discrete Mathematics and Theoretical Computer Science, 2002, Vol. 5, pp.17-46. ⟨10.46298/dmtcs.296⟩. ⟨hal-00958970⟩