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

E. [. Blumensath and . 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. Cau96 and . Caucal, On transition graphs having a decidable monadic theory, Icalp 96, pp.194-205, 1996.

]. D. Cau07 and . Caucal, Deterministic graph grammars, Texts in logics and games 2, pp.169-250, 2007.

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

]. A. Cm06a, A. Carayol, and . Meyer, Context-sensitive languages, rational graphs and determinism, Logical Methods in Computer Science, vol.2, issue.2, 2006.

]. A. Cm06b, C. Carayol, and . Morvan, On rational trees, LNCS, vol.06, issue.4207, pp.225-239, 2006.

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

]. N. Imm88 and . Immerman, Nondeterministic space is closed under complementation, SIAM Journal on computing, vol.17, issue.5, pp.935-938, 1988.

E. [. Knapik and . 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. Mor00 and . Morvan, On rational graphs, LNCS, vol.00, issue.1784, pp.252-266, 2000.

P. [. Muller and . 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 . 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

]. C. Ris03, The synchronized graphs trace the context-sensitive languages, ENTCS, pp.55-70, 2003.

G. Rozenberg, Handbook of Graph Grammars and Computing by Graph Transformations, Foundations. World Scientific, vol.1, 1997.
DOI : 10.1142/3303

]. R. Sze88 and . Szelepcsényi, The method of forced enumeration for nondeterministic automata, Acta Informatica, vol.26, issue.3, pp.279-284, 1988.