A. Blumensath, E. [. Grädel, L. Bárány, S. Kaiser, and . Rubin, Finite presentations of infinite structures: Automata and interpretations . Theory of Computing Systems Cardinality and counting quantifiers on omega-automatic structures, STACS'08 Ch. Delhommé. Automaticité des ordinaux et des graphes homogènes, pp.641-674, 1956.

W. Gasarch, A survey of recursive combinatorics, Handbook of recursive mathematics, pp.1040-1176, 1998.

G. Hjorth, B. Khoussainov, A. Montalbán, A. Nies, and C. G. Jockusch, From automatic structures to borel structures Ramsey's theorem and recursion theory, LICS'08, pp.431-441268, 1972.

D. Kuske, M. [. Lohrey, A. Khoussainov, . P. Neroderam30-]-f, ]. S. Ramseyrub08 et al., Automatic presentations of structures On a problem of formal logic Automata presenting structures: A survey of the finite string case, Logic and Computational Complexity, Lecture Notes in Comp. ScienceSie33] W. Sierpi´nskiSierpi´nski. Sur unprobì eme de la thèorie des relations. Ann. Scuola Norm. Sup. Pisa Handbook of Formal Languages, pp.129-150, 1930.