A. Bergeron-brlek, S. Brlek, A. Lacasse, and X. , Patterns in Smooth Tilings, Proc. WORDS'03, 4-th International Conference on Words Turku (Finland, pp.370-381, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00395296

V. Berthé, S. Brlek, and P. 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

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

S. Brlek and A. 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

S. Brlek, S. Dulucq, A. Ladouceur, and L. 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

A. Carpi, On repeated factors in C???-words, Information Processing Letters, vol.52, issue.6, pp.289-294, 1994.
DOI : 10.1016/0020-0190(94)00162-6

F. M. Dekking, On the structure of self generating sequences, p.31, 1980.

D. Jamet and G. Paquin, Discrete surfaces and infinite smooth words, annual International conference on Formal Power Series and Algebraic Combinatorics, pp.5-17, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00580569

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

G. Paquin, S. Brlek, and D. Jamet, Extremal generalized smooth words, JM'06, 2006.

G. Paquin, G. Melançon, and S. Brlek, Properties of the extremal infinite smooth words, J. of Automata, Languages and Combinatorics
URL : https://hal.archives-ouvertes.fr/hal-00391427

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

W. D. Weakley, On the number of C ? -words of each length, J. Combinatorial Theory Series A 51 no, pp.55-62, 1989.