J. R. Büchi, Weak Second-Order Arithmetic and Finite Automata, Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik, pp.66-92, 1960.
DOI : 10.1002/malq.19600060105

J. R. Büchi, On a Decision Method in Restricted Second Order Arithmetic, Logic Methodology and Philosophy of Science, Proceedings of the 1960 International Congress, pp.1-11, 1962.

J. R. Büchi and D. Siefkes, The monadic second order theory of ??1, Lecture Notes in Mathematics, vol.76, issue.2, pp.1-217, 1973.
DOI : 10.1007/978-3-662-36678-3

C. C. Chang and H. J. Keisler, Model Theory, American, 1973.

J. Duparc, La Forme Normale des Boréliens de Rang Fini, 1995.

J. Duparc, The Normal Form of Borel Sets, Part 1: Borel Sets of Finite Rank, Comptes Rendus de l, Académie des Sciences, vol.1, pp.651-656, 1995.

J. Duparc, Abstract, The Journal of Symbolic Logic, vol.1333, issue.01, pp.56-86, 2001.
DOI : 10.2307/1971035

J. Duparc, O. Finkel, and J. Ressayre, Computer science and the fine structure of Borel sets, Theoretical Computer Science, vol.257, issue.1-2, pp.85-105, 2001.
DOI : 10.1016/S0304-3975(00)00111-0

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

O. Finkel, J. Ressayre, and . Stretchings, Abstract, The Journal of Symbolic Logic, vol.1, issue.02, pp.563-585, 1996.
DOI : 10.1090/conm/065/891257

URL : https://hal.archives-ouvertes.fr/ensl-00319447

J. E. Hopcroft and J. D. Ullman, Formal Languages and their Relation to Automata, 1969.

A. S. Kechris, Classical Descriptive Set Theory, 1966.
DOI : 10.1007/978-1-4612-4190-4

L. H. Landweber, Decision Problems for ?-Automata, Mathematical Systems Theory, pp.376-384, 1969.

H. Lescow and W. Thomas, A Decade of Concurrency, Logical Specifications of Infinite Computations Lecture Notes in Computer Science, vol.803, pp.583-621, 1994.

]. A. Mey75 and . Meyer, Weak Monadic Second Order Theory of Successor Is Not Elementary Recursive, Logic Colloquium, Lecture Notes in Mathematics, vol.453, pp.1972-1973, 1975.

Y. N. Moschovakis, Descriptive Set Theory, North-Holland, 1980.

M. Parigot and E. Pelz, A logical approach of Petri net languages, Theoretical Computer Science, vol.39, pp.155-169, 1985.
DOI : 10.1016/0304-3975(85)90136-7

D. Perrin and J. Pin, Infinite Words, Automata, Semigroups, Logic and Games, Pure and Applied Mathematics, vol.141, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00112831

J. Ressayre, Abstract, The Journal of Symbolic Logic, vol.53, issue.04, pp.1009-1026, 1988.
DOI : 10.1017/S0022481200027894

H. Rogers, Theory of Recursive Functions and Effective Computability, Saf89] S. Safra, Complexity of Automata on Infinite Objects, 1967.

P. Simonnet, Automates et Théorie Descriptive, Comptes Rendus de l'Académie des Sciences, pp.97-100, 1992.

L. Staiger, Rozenberg and A. Salomaa editors, Handbook of Formal Languages, pp.339-388, 1997.

W. Thomas, Automata on Infinite Objects, pp.133-191, 1990.
DOI : 10.1016/B978-0-444-88074-1.50009-3

W. Thomas, . Languages, and L. Automata, Rozenberg and A. Salomaa editors, Handbook of Formal Languages, pp.389-456, 1997.

W. W. Wadge, Reducibility and Determinateness on the Baire Space, Wag79] K. Wagner, On Omega Regular Sets, Information and and Control, pp.123-177, 1979.