M. Béal, S. Lombardy, and J. Sakarovitch, On the equivalence of Zautomata, Proc. ICALP'05, pp.397-409, 2005.

C. Choffrut, Une caracterisation des fonctions sequentielles et des fonctions sous-sequentielles en tant que relations rationnelles, Theoretical Computer Science, vol.5, issue.3, pp.325-337, 1977.
DOI : 10.1016/0304-3975(77)90049-4
URL : http://doi.org/10.1016/0304-3975(77)90049-4

I. Klimann, S. Lombardy, J. Mairesse, and C. Prieur, Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton, Theoretical Computer Science, vol.327, issue.3, pp.349-373, 2004.
DOI : 10.1016/j.tcs.2004.02.049
URL : https://hal.archives-ouvertes.fr/hal-00174171

D. Lind, M. , and B. , An Introduction to Symbolic Dynamics and Coding, 1995.
DOI : 10.1017/CBO9780511626302

H. Maurer and M. Nivat, Rational bijection of rational sets, Acta Informatica, vol.11, issue.4, pp.365-378, 1980.
DOI : 10.1007/BF00288770

J. Sakarovitch, A construction on finite automata that has remained hidden, Theoretical Computer Science, vol.204, issue.1-2, pp.205-231, 1998.
DOI : 10.1016/S0304-3975(98)00040-1

J. Sakarovitch, Eléments de théorie des automates, Vuibert English translation, 2003.