G. Badkobeh and P. Ochem, Characterization of some binary words with few squares, Theoretical Computer Science, vol.588, pp.73-80, 2015.
DOI : 10.1016/j.tcs.2015.03.044
URL : https://hal.archives-ouvertes.fr/lirmm-01263844

K. A. Baker, G. F. Mcnulty, and W. Taylor, Growth problems for avoidable words, Theoretical Computer Science, vol.69, issue.3, pp.319-345, 1989.
DOI : 10.1016/0304-3975(89)90071-6

D. R. Bean, A. Ehrenfeucht, and G. F. Mcnulty, Avoidable patterns in strings of symbols, Pacific Journal of Mathematics, vol.85, issue.2, pp.261-294, 1979.
DOI : 10.2140/pjm.1979.85.261

J. Cassaigne, MotifsévitablesMotifsévitables et régularité dans les mots, 1994.

R. J. Clark, Avoidable formulas in combinatorics on words, 2001.

M. Lothaire, Algebraic Combinatorics on Words, 2002.
DOI : 10.1017/CBO9781107326019
URL : https://hal.archives-ouvertes.fr/hal-00620608

P. Ochem, A generator of morphisms for infinite words, RAIRO - Theoretical Informatics and Applications, vol.40, issue.3, pp.427-441, 2006.
DOI : 10.1051/ita:2006020
URL : https://hal.archives-ouvertes.fr/hal-00307126

P. Ochem, Binary words avoiding the pattern AABBCABBA, RAIRO - Theoretical Informatics and Applications, vol.44, issue.1, pp.151-158, 2010.
DOI : 10.1051/ita/2010010

P. Ochem, Doubled patterns are 3-avoidable, 2016. 10. A. Thue. ¨ Uber unendliche Zeichenreihen. 'Norske Vid. Selsk. Skr. I. Mat. Nat
URL : https://hal.archives-ouvertes.fr/lirmm-01375763

A. I. Zimin, BLOCKING SETS OF TERMS, Mathematics of the USSR-Sbornik, vol.47, issue.2, pp.353-364, 1984.
DOI : 10.1070/SM1984v047n02ABEH002647