J. Castro and F. Cucker, Nondeterministic ??-Computations and the Analytical Hierarchy, Zeitschrift f??r Mathematische Logik und Grundlagen der Mathematik, vol.24, issue.4, pp.333-342, 1989.
DOI : 10.1002/malq.19890350406

A. [. Cohen and . Gold, ??-Computations on Turing machines, Theoretical Computer Science, vol.6, issue.1, pp.1-23, 1978.
DOI : 10.1016/0304-3975(78)90002-6
URL : http://doi.org/10.1016/0304-3975(78)90002-6

]. O. Fin06a and . Finkel, Borel ranks and Wadge degrees of omega context free languages, Mathematical Structures in Computer Science, vol.16, issue.5, pp.813-840, 2006.

]. O. Fin06b and . Finkel, On the accepting power of two-tape Büchi automata, Proceedings of the 23rd International Symposium on Theoretical Aspects of Computer Science, STACS 2006, pp.301-312, 2006.

]. O. Fin09a and . Finkel, The complexity of infinite computations in models of set theory, Logical Methods in Computer Science, vol.5, issue.44, pp.1-19, 2009.

]. O. Fin09b and . Finkel, Highly undecidable problems for infinite computations, Theoretical Informatics and Applications, pp.339-364, 2009.

]. O. Fin10 and . Finkel, Decision problems for recognizable languages of infinite pictures, Studies in Weak Arithmetics, Proceedings of the International Conference 28th Weak Arithmetic Days of Publications of the Center for the Study of Language and Information, Lecture Notes, pp.127-151, 2009.

]. F. Gir81 and . Gire, Relations rationnelles infinitaires, 1981.

M. [. Gurevich, S. Magidor, and . Shelah, Abstract, Jounal of Symbolic Logic, pp.387-398, 1983.
DOI : 10.1007/BFb0082721

W. [. Grädel, W. Thomas, and . Wilke, Automata, Logics, and Infinite Games: A Guide to Current Research [outcome of a Dagstuhl seminar, Lecture Notes in Computer Science, vol.2500, 2001.
DOI : 10.1007/3-540-36387-4

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

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

]. A. Kan97 and . Kanamori, The Higher Infinite, 1997.

]. A. Kec75 and . Kechris, The theory of countable analytical sets. Transactions of the, pp.259-297, 1975.

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

L. H. Landweber, Decision problems for??-automata, Mathematical Systems Theory, vol.9, issue.4, pp.376-384, 1969.
DOI : 10.1007/BF01691063

W. [. Lescow and . Thomas, Logical specifications of infinite computations, Lecture Notes in Computer Science, vol.803, pp.583-621, 1994.

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

]. I. Nee08 and . Neeman, Finite state automata and monadic definability of singular cardinals, Jounal of Symbolic Logic, vol.73, pp.412-438, 2008.

D. Niwinski, On the cardinality of sets of infinite trees recognizable by finite automata, Proceedings of the International Conference MFCS, pp.367-376, 1991.
DOI : 10.1007/3-540-54345-7_80

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

]. H. Rog67 and . Rogers, Theory of Recursive Functions and Effective Computability, 1967.

L. Staiger, Hierarchies of recursive ?-languages, Elektronische Informationsverarbeitung und Kybernetik, vol.22, issue.5-6, pp.219-241, 1986.

]. L. Sta97 and . Staiger, ?-languages, Handbook of formal languages, pp.339-387, 1997.

W. Thomas, Automata on infinite objects Handbook of Theoretical Computer Science, volume B, Formal models and semantics, pp.135-191, 1990.