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

N. Chomsky, Three models for the description of language, IEEE Transactions on Information Theory, vol.2, issue.3, pp.113-124, 1956.
DOI : 10.1109/TIT.1956.1056813

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, 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. Elgot and J. Mezei, On Relations Defined by Generalized Finite Automata, IBM Journal of Research and Development, vol.9, issue.1, pp.47-68, 1965.
DOI : 10.1147/rd.91.0047

D. Epstein, J. W. Cannon, D. F. Holt, S. V. Levy, M. S. Paterson et al., Word processing in groups, 1992.

C. Frougny and J. Sakarovitch, Synchronized rational relations of finite and infinite words, Theoretical Computer Science, vol.108, issue.1, pp.45-82, 1993.
DOI : 10.1016/0304-3975(93)90230-Q

S. C. Kleene, Representation of Events in Nerve Nets and Finite Automata, Automata Studies, pp.3-40, 1956.
DOI : 10.1515/9781400882618-002

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

A. Meyer, Sur des sous-familles de graphes rationnels, 2002.

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

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

C. Morvan and C. Stirling, Rational Graphs Trace Context-Sensitive Languages, MFCS 01, 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

M. Penttonen, One-sided and two-sided context in formal grammars, Information and Control, vol.25, issue.4, pp.371-392, 1974.
DOI : 10.1016/S0019-9958(74)91049-3

S. Greibach and S. Ginsburg, Abstract families of languages, Mem. Am. Math. Soc, vol.87, 1969.

G. Sénizergues, Definability in weak monadic second-order logic of some infinite graphs, Dagstuhl seminar on Automata theory: Infinite computations, p.16, 1992.

T. Urvoy, Abstract Families of Graphs, DLT 02, pp.381-392, 2002.
DOI : 10.1007/3-540-45005-X_34