G. Badkobeh and P. Ochem, Characterization of some binary words with few squares, Theoret. Comput. Sci, vol.588, pp.73-80, 2015.
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.

D. R. Bean, A. Ehrenfeucht, and G. F. Mcnulty, Avoidable patterns in strings of symbols, the electronic journal of combinatorics, vol.85, issue.4, pp.261-294, 1979.

J. Berstel, Axel Thue's Papers on Repetitions in Words: a Translation, Number, vol.20, 1995.

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

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

G. Gamard, P. Ochem, G. Richomme, and P. Séébold, Avoidability of circular formulas
URL : https://hal.archives-ouvertes.fr/lirmm-01692716

L. Ilie, P. Ochem, and J. O. Shallit, A generalization of repetition threshold, Theoret. Comput. Sci, vol.92, issue.2, pp.71-76, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00307256

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

P. Ochem, A generator of morphisms for infinite words, RAIRO-Theoret. Informatics Appl, vol.40, pp.427-441, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00307126

P. Ochem, Binary words avoiding the pattern AABBCABBA, RAIRO-Theoret. Informatics Appl, vol.44, issue.1, pp.151-158, 2010.

P. Ochem, Doubled patterns are 3-avoidable, Electron. J. Combinatorics, vol.23, issue.1, 2016.
URL : https://hal.archives-ouvertes.fr/lirmm-01375763

P. Ochem and M. Rosenfeld, On some interesting ternary formulas, WORDS 2017. LNCS 10432
URL : https://hal.archives-ouvertes.fr/lirmm-02083616

A. Thue, ¨ Uber unendliche Zeichenreihen. Norske Vid. Selsk. Skr. I. Mat. Nat. Kl. Christiania, vol.7, pp.1-22, 1906.

A. I. Zimin, Blocking sets of terms, the electronic journal of combinatorics, vol.47, issue.2, pp.353-364, 1984.