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

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

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

J. Berstel, Fibonacci words ? a survey The Book of L, pp.13-27, 1986.

A. Cobham, On the hartmanis-stearns problem for a class of tag machines, 9th Annual Symposium on Switching and Automata Theory (swat 1968), pp.51-60, 1968.
DOI : 10.1109/SWAT.1968.20

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

S. Kitaev, T. Mansour, and P. Séébold, Generating the Peano curve and counting occurrences of some patterns, Journal of Automata, Languages and Combinatorics, vol.9, pp.439-455, 2004.

H. A. Maurer, G. Rozenberg, and E. , Using string languages to describe picture languages, Information and Control, vol.54, issue.3, pp.155-185, 1982.
DOI : 10.1016/S0019-9958(82)80020-X

J. Pansiot, Hierarchy and closure properties of various classes of tag-systems, Acta Informatica, vol.7, issue.2, pp.179-196, 1983.
DOI : 10.1007/BF00289415

G. Peano, Sur une courbe, qui remplit toute une aire plane, Mathematische Annalen, vol.36, issue.1, pp.157-160, 1890.
DOI : 10.1007/BF01199438

H. Sagan, Space-Filling curves, 1994.
DOI : 10.1007/978-1-4612-0871-6

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.