J. Allouche, A relative of the Thue-Morse sequence, Discrete Mathematics, vol.139, issue.1-3, pp.1-3, 1995.
DOI : 10.1016/0012-365X(93)00147-W
URL : https://hal.archives-ouvertes.fr/hal-00619176

J. Berstel, Axel Thue's papers on repetitions in words: a translation, In: Publications du LaCIM, vol.20, 1995.

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

S. Brlek, Enumeration of factors in the Thue-Morse word, Discrete Applied Mathematics, vol.24, issue.1-3, pp.1-3, 1989.
DOI : 10.1016/0166-218X(92)90274-E

K. T. Chen, R. H. Fox, and R. C. Lyndon, Free Differential Calculus, IV. The Quotient Groups of the Lower Central Series, The Annals of Mathematics, vol.68, issue.1, pp.81-95, 1958.
DOI : 10.2307/1970044

A. Ido, Factorisation du mot de Thue?Morse et de deux mots cousins, 1996.

C. Kimberling, Problem E 2850, Am. Math. Monthly, vol.87, pp.351-354, 1980.

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

G. Melançon, Combinatorics of Hall trees and Hall words, Journal of Combinatorial Theory, Series A, vol.59, issue.2, pp.285-308, 1992.
DOI : 10.1016/0097-3165(92)90070-B

G. Melançon, Lyndon factorization of infinite words, STACS '96, 13th Annual Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science 1046, pp.147-154, 1996.
DOI : 10.1007/3-540-60922-9_13

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

G. Melançon, Lyndon Factorization of Sturmian Words. Discrete Math, 1997.

C. Reutenauer, Mots de Lyndon et un théorème de Shirshov, Annales des Sciences Mathématiques du Québec, vol.10, issue.2, pp.237-245, 1986.

C. Reutenauer, Free lie algebras, 1993.
DOI : 10.1016/S1570-7954(03)80075-X

J. Shallit, A generalization of automatic sequences, Theoretical Computer Science, vol.61, issue.1, pp.1-16, 1988.
DOI : 10.1016/0304-3975(88)90103-X

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

S. Varricchio, Factorizations of free monoids and unavoidable regularities, Theoretical Computer Science, vol.73, issue.1, pp.81-89, 1990.
DOI : 10.1016/0304-3975(90)90163-C

X. Viennot, Algèbres de Lie libres et mono¨?desmono¨?des libres, Lecture Notes in Mathematics, vol.691, 1978.