J. Allouche and J. Shallit, The Ubiquitous Prouhet-Thue-Morse Sequence, Sequences and Their Applications, Proceedings of SETA'98, pp.1-16, 1999.
DOI : 10.1007/978-1-4471-0551-0_1

J. Allouche and J. Shallit, Sums of digits, overlaps, and palindromes, Discr. Math. Theoret. Comput . Sci, vol.4, pp.1-10, 2000.
URL : https://hal.archives-ouvertes.fr/hal-00958941

J. Berstel, Axel Thue's work on repetitions in words, Séries Formelles et Combinatoire Algébrique in Publications du LACIM, pp.65-80, 1992.

J. Berstel and L. Boasson, Partial words and a theorem of Fine and Wilf, Theoretical Computer Science, vol.218, issue.1, pp.135-141, 1999.
DOI : 10.1016/S0304-3975(98)00255-2

URL : https://hal.archives-ouvertes.fr/hal-00619468

J. Cassaigne, Unavoidable patterns, M. Lothaire, Algebraic Combinatorics on Words

C. Choffrut and J. Karhumäki, Combinatorics of Words, Handbook of Formal Languages, 1997.
DOI : 10.1007/978-3-642-59136-5_6

F. Dejean, Sur un th??or??me de Thue, Journal of Combinatorial Theory, Series A, vol.13, issue.1, pp.25-36, 1972.
DOI : 10.1016/0097-3165(72)90011-8

E. D. Fife, Binary sequences which contain no BBb, Trans. Amer. Math. Soc, vol.261, pp.115-136, 1980.

N. J. Fine and H. S. Wilf, Uniqueness theorems for periodic functions, Proc. Amer, pp.109-114, 1965.
DOI : 10.1090/S0002-9939-1965-0174934-9

A. Frid, Applying a uniform marked morphism to a word, Discr. Math. Theoret. Comput. Sci, vol.3, pp.125-140, 1999.
URL : https://hal.archives-ouvertes.fr/hal-00958931

V. Keränen, Abelian squares are avoidable on 4 letters, Automata, Languages and Programming Proceedings of ICALP'92 Lecture Notes in Comput. Sci.; V. 700, pp.41-52, 1992.
DOI : 10.1007/3-540-55719-9_62

P. Séébold, Sequences generated by infinitely iterated morphisms, Discrete Applied Mathematics, vol.11, issue.3, pp.255-264, 1985.
DOI : 10.1016/0166-218X(85)90077-0