J. Berstel and A. De-luca, Sturmian words, Lyndon words and trees, Theoretical Computer Science, vol.178, issue.1-2, pp.1-2, 1997.
DOI : 10.1016/S0304-3975(96)00101-6
URL : https://hal.archives-ouvertes.fr/hal-00619479

J. Berstel and M. Pochiolla, Average cost of Duval's algorithm for generating Lyndon words, Theor, Computer Science, vol.132, pp.415-425, 1994.

A. Cern´ycern´y, R. A. , O. A. Cern´ycern´y, and J. Gruska, Informatique théorique, Modular trellises, pp.337-349, 1985.

A. Cobham, Uniform tag sequences, Mathematical Systems Theory, vol.5, issue.1-2, pp.164-192, 1972.
DOI : 10.1007/BF01706087

G. Duchamp and D. Krob, Lazard's factorizations of free partially commutative monoids, Proc. ICALP, pp.242-253, 1991.
DOI : 10.1007/3-540-54233-7_138

J. P. Duval, Factorizing words over an ordered alphabet, Journal of Algorithms, vol.4, issue.4, pp.363-381, 1983.
DOI : 10.1016/0196-6774(83)90017-2

A. Ido and G. Melançon, Lyndon factorization of the Thue-Morse word and its relatives, Discrete Mathematics and Theoretical Computer Science, vol.1, issue.1, pp.43-52, 1997.
URL : https://hal.archives-ouvertes.fr/hal-00955689

M. Lothaire, Combinatorics on words, 1983.
DOI : 10.1017/CBO9780511566097
URL : https://hal.archives-ouvertes.fr/hal-00620607

G. Melançon, Lyndon factorization of infinite words, Proceedings STACS'96 LNCS 1046, pp.147-154, 1996.
DOI : 10.1007/3-540-60922-9_13

G. Melançon, Lyndon factorization of sturmian words, 8th international Conference on Formal Power Series and Algebraic Combinatorics (FPSAC), 1996.
DOI : 10.1016/S0012-365X(99)00123-5

G. Melançon, Viennot factorization of infinite words, Information Processing Letters, vol.60, issue.2, pp.53-57, 1996.
DOI : 10.1016/S0020-0190(96)00147-0

M. E. Prouhet, Mémoire sur quelques relations entre les puissances des nombres, Cahier 31, p.225, 1851.

P. Séébold, Generalized thue-morse sequences, Proc. FCT'85, pp.402-411, 1985.
DOI : 10.1007/BFb0028824

P. Séébold, ComplémentComplément`Complémentà l'´ etude des suites de Thue-Morse généralisées, Infromatique théorique et applications, vol.20, pp.157-181, 1986.

R. Siromoney, L. Matthew, V. R. Dare, and K. G. Subramanian, Infinite Lyndon words, Information Processing Letters, vol.50, issue.2, pp.101-104, 1994.
DOI : 10.1016/0020-0190(94)90016-7

A. Thue, Uber die gegenseitige Lage gleichen Teile gewisser Zeichenreihen, Videnskapsselskapets Skifter, I. Mat. -naturv. Klasse, Kristiania, vol.1, pp.1-67, 1912.

. Varricchio, Factorizations of free monoids and unavoidable regularities, Theor, Computer Science, vol.73, pp.81-89, 1990.