S. [. Bergeron-brlek, A. Brlek, X. Lacasse, and . Provençal, Patterns in smooth tilings, Proceedings of WORDS'03, pp.370-381, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00395296

S. [. Berthé, P. Brlek, and . Choquette, Smooth words over arbitrary alphabets, Theoretical Computer Science, vol.341, issue.1-3, pp.293-310, 2005.
DOI : 10.1016/j.tcs.2005.04.010

]. J. Bdl97, A. Berstel, and . De-luca, Sturmian words, Lyndon words and trees, Theoret. Comput. Sci, vol.178, issue.1 2, pp.171-203, 1997.

S. [. Brlek, A. Dulucq, L. Ladouceur, and . Vuillon, Combinatorial properties of smooth infinite words, Theoretical Computer Science, vol.352, issue.1-3, pp.306-317, 2006.
DOI : 10.1016/j.tcs.2005.12.003
URL : https://hal.archives-ouvertes.fr/hal-00387985

D. [. Brlek, G. Jamet, and . Paquin, Smooth words on 2-letter alphabets having same parity, Theoretical Computer Science, vol.393, issue.1-3, pp.166-181, 2008.
DOI : 10.1016/j.tcs.2007.11.019
URL : https://hal.archives-ouvertes.fr/hal-00579854

A. [. Brlek and . Ladouceur, A note on differentiable palindromes, Theoretical Computer Science, vol.302, issue.1-3, pp.167-178, 2003.
DOI : 10.1016/S0304-3975(02)00746-6

G. [. Brlek, G. Melançon, and . Paquin, Properties of the extremal infinite smooth words. Discrete Math, Theoret. Comput. Sci, vol.9, issue.2, pp.33-49, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00391427

]. A. Car94 and . Carpi, On repeated factors in C ? -words, Information Processing Letters, vol.52, pp.289-294, 1994.

R. [. Chen, R. C. Fox, and . 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

]. F. Dek81 and . Dekking, On the structure of self generating sequences, p.31, 1980.

]. Duv83 and . Duval, Factorizing words over an ordered aphabet, Journal of Algorithms, vol.4, pp.363-381, 1983.

]. Duv88 and . Duval, Génération d'une section des classes de conjugaison et arbre de mots de Lyndon de longueur bornée, Theoret. Comput. Sci, vol.60, pp.255-283, 1988.

C. [. Hohlweg and . Reutenauer, Lyndon words, permutations and trees, Theoretical Computer Science, vol.307, issue.1, pp.173-178, 2003.
DOI : 10.1016/S0304-3975(03)00099-9

]. Y. Hua97 and . Huang, On the condition of powers of C ? -word to be a C ? -word, Applied Mathematics -A Journal of Chinese Universities (Ser. A), vol.2, pp.243-246, 1997.

]. Y. Hua08, . [. Huang, G. Jamet, and . Paquin, On the number of C ? -words of form?wxwform? form?wxw Discrete surfaces and infinite smooth words, FPSAC'05 -17th annual International conference on Formal Power Series and Algebraic Combinatorics, pp.280-286, 2005.

]. W. Kol65 and . Kolakoski, Self generating runs, Problem 5304, Amer. Math. Monthly, vol.72, p.674, 1965.

]. M. Lot83 and . Lothaire, Combinatorics on words, 1983.

]. G. Mel00 and . Melançon, Lyndon factorization of Sturmian words, Discrete Appl. Math, vol.210, pp.137-149, 2000.

C. [. Melançon and . Reutenauer, Lyndon words, free algebras and shuffles. Canad, J. Math, vol.4, pp.577-591, 1989.

]. G. Paq08a and . Paquin, Infinite smooth Lyndon words, PSC'08 -Prague Stringology Conference, 2008.

]. G. Paq08b and . Paquin, MotséquilibrésMots´Motséquilibrés et mots lisses, 2008.

]. C. Reu07 and . Reutenauer, Mots de Lyndon généralisés, B54h, 16 pp. (electronic), p.7, 2005.