Automatic sequences: theory, applications, generalizations, 2003. ,
DOI : 10.1017/CBO9780511546563
Démonstration de l'existence de suites asymétriques infinies, Mat. Sb, vol.44, pp.769-777, 1937. ,
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
Fibonacci words ? a survey The Book of L, pp.13-27, 1986. ,
A characterization of Sturmian morphisms, Lect. Notes Comp. Sci, pp.711-281, 1993. ,
DOI : 10.1007/3-540-57182-5_20
URL : https://hal.archives-ouvertes.fr/hal-00619894
A remark on morphic sturmian words, RAIRO - Theoretical Informatics and Applications, vol.28, issue.3-4, pp.255-263, 1994. ,
DOI : 10.1051/ita/1994283-402551
URL : https://hal.archives-ouvertes.fr/hal-00619499
Combinatorial properties of smooth infinite words, Theoretical Computer Science, vol.352, issue.1-3, pp.306-317, 2006. ,
DOI : 10.1016/j.tcs.2005.12.003
URL : https://hal.archives-ouvertes.fr/hal-00387985
Uniform tag sequences, Mathematical Systems Theory, vol.5, issue.1-2, pp.164-192, 1972. ,
DOI : 10.1007/BF01706087
The weird and wonderful chemistry of audioactive decay Open problems in communication and computation, pp.173-188, 1987. ,
A propos d'une itération sur cha??nescha??nes de caractères numériques, Laboratoire d'Analyse Numérique et d'Optimisation, Research Report ANO, vol.293, issue.8, p.pp, 1993. ,
Cha??nesCha??nes alphanumériques ; cycles et points fixes, Laboratoire d'Analyse Numérique et d'Optimisation, Research Report ANO, vol.301, issue.23, p.pp, 1993. ,
Mots autodescriptifs et co-descriptifs, Laboratoire d'Analyse Numérique et d'Optimisation, Research Report ANO, vol.332, issue.32, p.pp, 1994. ,
Reprinted in the Cambridge Mathematical Library, of Encyclopedia of Mathematics and Applications, 1983. ,
Lyndon factorization of sturmian words, Discrete Math, pp.137-149, 2000. ,
Hierarchy and closure properties of various classes of tag-systems, Acta Informatica, vol.7, issue.2, pp.179-196, 1983. ,
DOI : 10.1007/BF00289415
On morphisms preserving infinite Lyndon words, Discrete Math. and Theoret, Comput. Sci, vol.9, pp.89-108, 2007. ,
On the conjugation of standard morphisms, Theoretical Computer Science, vol.195, issue.1, pp.91-109, 1998. ,
DOI : 10.1016/S0304-3975(97)00159-X
About some overlap-free morphisms on a n-letter alphabet, Journal of Automata , Languages and Combinatorics, vol.7, pp.579-597, 2002. ,
Infinite Lyndon words, Information Processing Letters, vol.50, issue.2, pp.101-104, 1994. ,
DOI : 10.1016/0020-0190(94)90016-7