J. Berstel, Transductions and context-free languages. Teubner, 1979.
URL : https://hal.archives-ouvertes.fr/hal-00619779

A. Blumensath and E. Grädel, Automatic structures, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332), pp.51-62, 2000.
DOI : 10.1109/LICS.2000.855755

D. Caucal, Deterministic graph grammars, Texts in logics and games 2, pp.169-250, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00867578

D. Caucal and T. Knapik, An internal presentation of regular graphs by prefix-recognizable ones. Theory of Computing Systems, 2001.

A. Carayol and A. Meyer, Context-Sensitive Languages, Rational Graphs and Determinism, Logical Methods in Computer Science, vol.2, issue.2, 2006.
DOI : 10.2168/LMCS-2(2:6)2006

URL : https://hal.archives-ouvertes.fr/hal-00149086

A. Carayol and C. Morvan, On Rational Trees, ZoltánZoltán´ZoltánÉsik, editor, CSL 06, pp.225-239, 2006.
DOI : 10.1007/11874683_15

URL : https://hal.archives-ouvertes.fr/hal-00620171

]. B. Cou90 and . Courcelle, Handbook of Theoretical Computer Science, chapter Graph rewriting: an algebraic and logic approach, 1990.

A. Carayol and S. Woehrle, The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata, FSTTCS 03, pp.112-123, 2003.
DOI : 10.1007/978-3-540-24597-1_10

N. Immerman, Nondeterministic Space is Closed under Complementation, SIAM Journal on Computing, vol.17, issue.5, pp.935-938, 1988.
DOI : 10.1137/0217058

T. Knapik and E. Payet, Synchronization product of linear bounded machines, FCT, pp.362-373, 1999.

]. Kur64 and . Kuroda, Classes of languages and linear-bounded automata, Information and Control, vol.7, issue.2, pp.207-223, 1964.

C. Morvan, On Rational Graphs, Fossacs 00, pp.252-266, 2000.
DOI : 10.1007/3-540-46432-8_17

URL : https://hal.archives-ouvertes.fr/hal-00620062

D. Muller and P. Schupp, The theory of ends, pushdown automata, and second-order logic, Theoretical Computer Science, vol.37, pp.51-75, 1985.
DOI : 10.1016/0304-3975(85)90087-8

C. Morvan and C. Stirling, Rational Graphs Trace Context-Sensitive Languages, MFCS, pp.548-559, 2001.
DOI : 10.1007/3-540-44683-4_48

URL : https://hal.archives-ouvertes.fr/hal-00950050

R. Szelepcsényi, The method of forced enumeration for nondeterministic automata, Acta Informatica, vol.33, issue.3, pp.279-284, 1988.
DOI : 10.1007/BF00299636