&. P. Alur and . Madhusudan, Visibly pushdown languages, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing , STOC '04, pp.202-211, 2004.
DOI : 10.1145/1007352.1007390
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.3757

J. Berstel, Transductions and context-free languages, 1979.
DOI : 10.1007/978-3-663-09367-1
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

A. Carayol and &. C. Morvan, On Rational Trees, CSL 06, pp.225-239, 2006.
DOI : 10.1007/11874683_15
URL : https://hal.archives-ouvertes.fr/hal-00620171

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

D. Caucal and &. S. Hassen, Synchronization of Grammars, CSR 08, pp.110-121, 2008.
DOI : 10.1007/978-3-540-79709-8_14
URL : https://hal.archives-ouvertes.fr/hal-00620185

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

T. Colcombet, On Families of Graphs Having a Decidable First Order Theory with Reachability, Proceedings of the 29th International Conference on Automata, Languages, and Programming, pp.98-109, 2002.
DOI : 10.1007/3-540-45465-9_10

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

C. Courcelle and &. I. Walukiewicz, Monadic second-order logic, graph coverings and unfoldings of transition systems, Annals of Pure and Applied Logic, vol.92, issue.1, pp.35-62, 1998.
DOI : 10.1016/S0168-0072(97)00048-1

S. Kuroda, Classes of languages and linear-bounded automata, Information and Control, vol.7, issue.2, pp.207-223, 1964.
DOI : 10.1016/S0019-9958(64)90120-2

M. Leucker, Prefix-Recognizable Graphs and Monadic Logic, Automata, Logics, and Infinite Games, pp.263-284, 2001.
DOI : 10.1007/3-540-36387-4_15

C. Morvan, On Rational Graphs, Fossacs 00, LNCS 1784, pp.252-266, 2000.
DOI : 10.1007/3-540-46432-8_17
URL : https://hal.archives-ouvertes.fr/hal-00620062

C. Morvan, Contextual graph grammars characterizing context-sensitive languages, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00366942

C. Morvan and &. C. Stirling, Rational Graphs Trace Context-Sensitive Languages, MFCS, LNCS 2136, pp.548-559, 2001.
DOI : 10.1007/3-540-44683-4_48
URL : https://hal.archives-ouvertes.fr/hal-00950050

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

J. L. Peterson, Petri Net Theory and the Modeling of Systems, 1981.

I. Walukiewicz, Model Checking CTL Properties of Pushdown Systems, pp.127-138, 1974.
DOI : 10.1007/3-540-44450-5_10