]. O. Bel94 and . Belegradek, The model theory of unitriangular groups, Annals of Pure and Applied Logic, vol.68, pp.225-261, 1994.

E. [. Blumensath and . Grädel, Finite presentations of infinite structures: Automata and interpretations. Theory of Computing Systems, pp.641-674, 2004.

L. [. Bárány, S. Kaiser, and . Rubin, Cardinality and counting quantifiers on omega-automatic structures, STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science Proceedings, volume 08001 of Dagstuhl Seminar Proceedings, pp.385-396, 2008.

]. A. Blu99, R. Blumensath, and . Aachen, Automatic Structures, 1999.

I. Farah, Analytic quotients: theory of liftings for quotients over analytic ideals on the integers, Memoirs of the American Mathematical Society, vol.148, issue.702, 2000.
DOI : 10.1090/memo/0702

B. [. Hjorth, A. Khoussainov, A. Montalbán, and . Nies, From Automatic Structures to Borel Structures, 2008 23rd Annual IEEE Symposium on Logic in Computer Science, pp.431-441, 2008.
DOI : 10.1109/LICS.2008.28

J. E. Hopcroft, R. Motwani, and J. D. Ullman, Introduction to automata theory, languages, and computation, 2001.
DOI : 10.1145/568438.568455

]. B. Hod83 and . Hodgson, Décidabilité par automate fini, Annales Scientifiques de Mathématiques du Québec, vol.7, issue.1, pp.39-57, 1983.

]. T. Jec02 and . Jech, Set theory, third edition, 2002.

A. [. Just and . Krawczyk, On certain Boolean algebras P(?)/I. Transactions of the, pp.411-429, 1984.

]. W. Jus92 and . Just, A weak version of AT from OCA, Set theory of the continuum, pp.281-291, 1989.

]. A. Kec95 and . Kechris, Classical descriptive set theory, 1995.

M. [. Kuske and . Lohrey, Abstract, The Journal of Symbolic Logic, vol.2996, issue.01, pp.129-150, 2008.
DOI : 10.1016/j.ipl.2006.06.011

A. [. Khoussainov and . Nerode, Open questions in the theory of automatic structures, Bulletin of the European Association of Theoretical Computer Science, vol.94, pp.181-204, 2008.

A. [. Khoussainov, S. Nies, F. Rubin, and . Stephan, Automatic structures: Richness and limitations, Logical Methods in Computer Science, vol.3, issue.2, pp.1-18, 2007.

B. Khoussainov and S. Rubin, Automatic structures: Overview and future directions, Journal of Automata, Languages and Combinatorics, vol.8, issue.2, pp.287-301, 2003.

H. Lescow and W. Thomas, Logical specifications of infinite computations, Decade of Concurrency, pp.583-621, 1994.

]. Y. Mos80 and . Moschovakis, Descriptive set theory, 1980.

]. A. Nie07 and . Nies, Describing groups, Bulletin of Symbolic Logic, vol.13, issue.3, pp.305-339, 2007.

J. [. Perrin and . Pin, Infinite words, automata, semigroups, logic and games, Pure and Applied Mathematics, vol.141, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00112831

]. S. Rub04 and . Rubin, Automatic Structures, 2004.

]. S. Rub08 and . Rubin, Automata presenting structures: A survey of the finite string case Bulletin of Symbolic Logic, Sta97] L. Staiger. ?-languages Handbook of formal languages, pp.169-209, 1997.

]. W. Tho90 and . Thomas, Automata on infinite objects Handbook of Theoretical Computer Science, volume B, Formal models and semantics, Contemporary Mathematics, vol.84, pp.135-191, 1989.

]. S. Tod98 and . Todor?evi´todor?evi´c, Gaps in analytic quotients, Fundamenta Mathematicae, vol.156, issue.1, pp.85-97, 1998.