J. Allouche and J. Shallit, Sums of digits, overlaps, and palindromes, Discrete Math, & Theoret. Comput. Sci, vol.4, pp.1-10, 2000.

J. Allouche and J. Shallit, Automatic sequences: theory, applications, generalizations, 2003.
DOI : 10.1017/CBO9780511546563

S. Arshon, Démonstration de l'existence de suites asymétriques infinies, Mat. Sb, vol.44, pp.769-777, 1937.

E. Babson and E. Steingrímsson, Generalized permutation patterns and a classification of the Mahonian statistics, Art. B44b, p.pp, 2000.

J. Berstel, Mots sans carre et morphismes iteres, Discrete Mathematics, vol.29, issue.3, pp.235-244, 1980.
DOI : 10.1016/0012-365X(80)90151-X
URL : https://hal.archives-ouvertes.fr/hal-00619354

F. Brandenburg, Uniformly growing k-th power-free homomorphisms, Theoretical Computer Science, vol.23, issue.1, pp.69-82, 1983.
DOI : 10.1016/0304-3975(88)90009-6

A. Burstein, Enumeration of words with forbidden patterns, 1998.

A. Burstein and T. Mansour, Words restricted bypatterns with at most 2 distinct letters, Electronic J. of Combinatorics, vol.9, issue.2, p.3, 2002.

A. Burstein and T. Mansour, Words Restricted by 3-Letter Generalized Multipermutation Patterns, Annals of Combinatorics, vol.7, issue.1, pp.1-14, 2003.
DOI : 10.1007/s000260300000

A. Burstein and T. Mansour, Counting occurrences of some subword patterns, Discrete Math. & Theoret. Comput. Sci, vol.6, pp.1-1, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00958999

A. Claesson, Generalized Pattern Avoidance, European Journal of Combinatorics, vol.22, issue.7, pp.961-971, 2001.
DOI : 10.1006/eujc.2001.0515

A. Cobham, Uniform tag sequences, Mathematical Systems Theory, vol.5, issue.1-2, pp.164-192, 1972.
DOI : 10.1007/BF01706087

J. Currie, No iterated morphism generates any Arshon sequence of odd order, Discrete Mathematics, vol.259, issue.1-3, pp.277-283, 2002.
DOI : 10.1016/S0012-365X(02)00372-2

S. Kitaev, There are no iterated morphisms that define the Arshon sequence and the sigmasequence, Automata, Languages and Combinatorics, vol.8, pp.43-50, 2003.

S. Kitaev, Multi-avoidance of generalised patterns, Discrete Mathematics, vol.260, issue.1-3, pp.89-100, 2003.
DOI : 10.1016/S0012-365X(02)00452-1

S. Kitaev, T. Mansour, and P. Séébold, The Peano curve and counting occurrences of some patterns, Journal of Automata, Languages and Combinatorics

D. E. Knuth, The Art of Computer Programming, 1973.

M. Lothaire, Reprinted in the Cambridge Mathematical Library, of Encyclopedia of Mathematics and Applications, 1983.

M. Morse, Recurrent geodesics on a surface of negative curvature, Transactions of the American Mathematical Society, vol.22, issue.1, pp.84-100, 1921.
DOI : 10.1090/S0002-9947-1921-1501161-8

M. E. Prouhet, Mémoire sur quelques relations entre les puissances des nombres, Comptes Rendus Acad. Sci. Paris, vol.33, p.225, 1851.

A. Salomaa, Jewels of Formal Language Theory, 1981.

P. Séébold, About some overlap-free morphisms on a n-letter alphabet, Journal of Automata, Languages and Combinatorics, vol.7, pp.579-597, 2002.

P. Séébold, On some generalizations of the Thue???Morse morphism, Theoretical Computer Science, vol.292, issue.1, pp.283-298, 2003.
DOI : 10.1016/S0304-3975(01)00228-6

R. Simion and F. Schmidt, Restricted Permutations, European Journal of Combinatorics, vol.6, issue.4, pp.383-406, 1985.
DOI : 10.1016/S0195-6698(85)80052-4
URL : http://doi.org/10.1016/s0195-6698(85)80052-4