https://hal.inria.fr/hal-00958970Černý, AntonAntonČernýDepartment of Mathematics and Computer Science [Kuwait] - Kuwait UniversityLyndon factorization of generalized words of ThueHAL CCSD2002Lyndon wordLyndon factorizationautomatic sequence[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]Inria Sophia Antipolis-Méditerranée / I3s, Service Ist2014-03-13 16:54:272017-11-29 10:26:222014-03-13 21:14:05enJournal articleshttps://hal.inria.fr/hal-00958970/document10.46298/dmtcs.296application/pdf1The 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.