1. Automates finis en théorie des nombres;Allouche;Exposition. Math.,1987
2. Ensembles reconnaissables de mots bi-infinis;Beaquier,1985
3. J. Berstel, Axel Thue's Papers on Repetitions in Words: a Translation, Publications du Laboratoire de Combinatoire et d'Informatique Mathématique, Number 20, Université du Québec à Montréal, February 1995.
4. A. Cobham, On the Hartmanis–Stearns problem for a class of tag machines, in: IEEE Conference Record of 1968 Ninth Annual Symposium on Switching and Automata Theory, pp. 51–60, 1968 (also appeared as IBM Research Technical Report RC-2178, August 23, 1968).
5. Finitary codes for biinfinite words;Devolder;RAIRO Inform. Théor. Appl.,1992