[. Autebert, L. Boasson, . Transductions-rationelles, and . Masson, [Ber79] J. Berstel, Transductions and context-free languages, Teubner, Blumensath and E. Grädel, Automatic Structures, Proceedings of 15th IEEE Symposium on Logic in Computer Science LICS, pp.51-62, 1979.

J. R. Büchi, On a Decision Method in Restricted Second Order Arithmetic, pp.1-11, 1960.
DOI : 10.1007/978-1-4613-8928-6_23

]. B. Cou90 and . Courcelle, Handbook of theoretical computer science, ch. Graph rewriting: an algebraic and logic approach, 1990.

W. Damm, Languages defined by higher type program schemes, LNCS, vol.77, issue.52, pp.164-179, 1977.
DOI : 10.1007/3-540-08342-1_13

]. D. Ech-+-92, J. W. Epstein, D. F. Cannon, S. V. Holt, M. S. Levy et al., Word processing in groups, Jones and Barlett publishers, EF95] H. D. Ebbinghaus and J. Flum, Finite model theoryEil74] S. Eilenberg, Automata, languages and machines, 1974.

B. R. Hodgson, Décidabilité par automate fini, Ann. Sci. Math. Québec, vol.7, pp.39-57, 1983.

A. [. Khoussainov and . Nerode, Automatic presentations of structures, LNCS, vol.960, pp.367-392, 1994.
DOI : 10.1007/3-540-60178-3_93

B. Khoussainov, S. Rubin, and F. Stephan, Automatic linear orders and trees, ACM Transactions on Computational Logic, vol.6, issue.4, pp.675-700, 2005.
DOI : 10.1145/1094622.1094625

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.2286

M. Lohrey, Automatic Structures of Bounded Degree, Proceedings of LPAR 03, LNAI, pp.344-358, 2003.
DOI : 10.1007/978-3-540-39813-4_25

C. Morvan, On rational graphs, Fossacs 00, LNCS, vol.1784, pp.252-266, 2000.

P. [. Muller and . Schupp, The theory of ends, pushdown automata, and second-order logic, Thèse de doctorat, Université de Rennes 1, pp.51-75, 1985.
DOI : 10.1016/0304-3975(85)90087-8

C. Morvan and C. Stirling, Rational Graphs Trace Context-Sensitive Languages, Pél97] L. Pélecq, Isomorphismes et automorphismes des graphes context-free, ´ equationnels et automatiques, pp.548-559, 1997.
DOI : 10.1007/3-540-44683-4_48

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

M. O. Rabin, Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. soc, vol.141, pp.1-35, 1969.

A. Shelah, Composition theorem for generalized sum Synchronized graphs trace the context-sensitive languages The monadic theory of order Definability in weak monadic second-order logic of some infinite graphs, Dagstuhl seminar on Automata theory: Infinite computations, pp.2-379, 1975.

W. S. Thomaszei94-]-r and . Zeitman, A short introduction to infinite automata The composition method, LNCS, vol.2295, issue.01, pp.130-144, 1994.