J. Autebert, J. Berstel, and L. Boasson, Context-Free Languages and Pushdown Automata, Handbook of formal languages, 1997.
DOI : 10.1007/978-3-642-59136-5_3
URL : https://hal.archives-ouvertes.fr/hal-00620669

A. Arnold, Topological characterizations of infinite behaviours of transition systems, Proceedings of the International Conference on Automata, Languages and Programming, 10th Colloquium, pp.28-38, 1983.
DOI : 10.1007/BFb0036895

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

J. Engelfriet and H. J. Hoogeboom, X-automata on ??-words, Theoretical Computer Science, vol.110, issue.1, pp.1-51, 1993.
DOI : 10.1016/0304-3975(93)90349-X

O. Finkel, D. [. Lecomte, L. Freund, and . Staiger, Classical and effective descriptive complexities of <mml:math altimg="si2.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>??</mml:mi></mml:math>-powers, Words, Sequences, Grammars, Languages: where BiologyFS03] O. Finkel and P. Simonnet. Topology and ambiguity in omega context free languages. Bulletin of the Belgian Mathematical Society, pp.163-191, 2000.
DOI : 10.1016/j.apal.2009.02.005

L. A. Harrington, A. S. Kechris, and A. Louveau, A Glimm-Effros dichotomy for Borel equivalence relations, Journal of the American Mathematical Society, vol.3, issue.4, pp.903-928, 1990.
DOI : 10.1090/S0894-0347-1990-1057041-5

A. S. Kechris, Classical descriptive set theory, 1995.
DOI : 10.1007/978-1-4612-4190-4

W. [. Lescow and . Thomas, 1 Borel sets Logical specifications of infinite computations, Decade of Concurrency, pp.915-920, 1989.

Y. N. Moschovakis, Descriptive set theory, volume 155 of Mathematical Surveys and Monographs, 2009.

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

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

V. L. Selivanov, Wadge Degrees of ??-Languages of Deterministic Turing Machines, Proceedings of the International Conference STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, pp.97-108, 2003.
DOI : 10.1007/3-540-36494-3_10

V. L. Selivanov, Wadge degrees of ?-languages of deterministic Turing machines, Theoretical Informatics and Applications, pp.67-83, 2003.

L. Staiger, Recursive automata on infinite words, Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science, STACS 93, pp.629-639, 1993.
DOI : 10.1007/3-540-56503-5_62

L. Staiger, ??-Languages, Handbook of formal languages, pp.339-387, 1997.
DOI : 10.1007/978-3-642-59126-6_6

L. Staiger, On the power of reading the whole infinite input tape [Sta00] L. Staiger. On the power of reading the whole infinite input tape, Finite Versus Infinite: Contributions to an Eternal Dilemma, pp.247-257, 1999.
DOI : 10.1023/A:1009976931662

L. Staiger and K. Wagner, Recursive ?-languages, Fundamentals of computation theory (Proc. Internat. Conf., Pozna´nPozna´n-Kórnik, pp.532-537, 1977.

L. Staiger and K. Wagner, Rekursive Folgenmengen I, Zeitschrift f??r Mathematische Logik und Grundlagen der Mathematik, vol.22, issue.31-36, pp.523-538, 1978.
DOI : 10.1002/malq.19780243107

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