K. Barthelmann, When can an equational simple graph be generated by hyperedge replacement?, MFCS, pp.543-552, 1998.
DOI : 10.1007/BFb0055804
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.5057

A. Blumensath and E. Grädel, Finite Presentations of Infinite Structures: Automata and Interpretations, Theory of Computing Systems, vol.37, issue.6, pp.641-674, 2004.
DOI : 10.1007/s00224-004-1133-y

C. H. Broadbent, A. Carayol, M. Hague, and O. Serre, A Saturation Method for Collapsible Pushdown Systems, In ICALP LNCS, vol.7392, issue.2, pp.165-176, 2012.
DOI : 10.1007/978-3-642-31585-5_18
URL : https://hal.archives-ouvertes.fr/hal-00694991

C. H. Broadbent, A. Carayol, C. Ong, and O. Serre, Recursion Schemes and Logical Reflection, 2010 25th Annual IEEE Symposium on Logic in Computer Science, pp.120-129, 2010.
DOI : 10.1109/LICS.2010.40
URL : https://hal.archives-ouvertes.fr/hal-00479818

A. Carayol, Regular Sets of Higher-Order Pushdown Stacks, MFCS, pp.168-179, 2005.
DOI : 10.1007/11549345_16
URL : https://hal.archives-ouvertes.fr/hal-00620141

A. Carayol and O. Serre, Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection, 2012 27th Annual IEEE Symposium on Logic in Computer Science, pp.165-174, 2012.
DOI : 10.1109/LICS.2012.73
URL : https://hal.archives-ouvertes.fr/hal-00733467

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

D. Caucal, On infinite transition graphs having a decidable monadic theory, ICALP, volume 1099 of LNCS, pp.194-205, 1996.
DOI : 10.1007/3-540-61440-0_128
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.3432

D. Caucal, On Infinite Terms Having a Decidable Monadic Theory, MFCS, pp.165-176, 2002.
DOI : 10.1007/3-540-45687-2_13

T. Colcombet and C. Löding, Transforming structures by set interpretations, Logical Methods in Computer Science, vol.3, issue.2, 2007.
DOI : 10.2168/LMCS-3(2:4)2007
URL : https://hal.archives-ouvertes.fr/hal-00192051

M. Dauchet and S. Tison, The theory of ground rewrite systems is decidable, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science, pp.242-248, 1990.
DOI : 10.1109/LICS.1990.113750

T. Knapik, D. Niwinski, and . Urzyczyn, Higher-Order Pushdown Trees Are Easy, FoSSaCS, pp.205-222, 2002.
DOI : 10.1007/3-540-45931-6_15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.5773

A. Meyer, Traces of term-automatic graphs, ITA, vol.42, issue.3, pp.615-630, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00681214

O. Michael and . Rabin, Decidability of second-order theories and automata on infinite trees, BULLETIN of the American Mathematical Society, vol.74, pp.1025-1029, 1968.

C. Rispal, The synchronized graphs trace the context-sensitive languages, Electronic Notes in Theoretical Computer Science, vol.68, issue.6, pp.55-70, 2002.
DOI : 10.1016/S1571-0661(04)80533-4
URL : https://hal.archives-ouvertes.fr/hal-00620118