M. Béal, O. Carton, C. Prieur, and J. Sakarovitch, Squaring transducers: an efficient procedure for deciding functionality and sequentiality, Theoretical Computer Science, vol.292, issue.1, pp.45-63, 2003.
DOI : 10.1016/S0304-3975(01)00214-6

]. J. Ber79 and . Berstel, Transductions and context free languages, Teubner Studienbücher Informatik, 1979.

M. Ya, B. A. Barzdin, and . Trakhtenbrot, Finite automata, behaviour and synthesis, 1970.

J. R. Büchi, On a Decision Method in Restricted Second Order Arithmetic, Proceedings of the 1960 International Congress on Logic Methodology and Philosophy of Science, pp.1-11, 1962.
DOI : 10.1007/978-1-4613-8928-6_23

C. Choffrut and S. Grigorieff, Uniformization of Rational Relations, Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa, pp.59-71, 1999.
DOI : 10.1007/978-3-642-60207-8_6

O. Carton and D. Perrin, Chains and Superchains for ??-Rational Sets, Automata and Semigroups, International Journal of Algebra and Computation, vol.07, issue.06, pp.673-695597, 1997.
DOI : 10.1142/S0218196797000290

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-105161, 2001.
DOI : 10.1016/S0304-3975(00)00111-0

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

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

J. Duparc, A hierarchy of deterministic context-free ??-languages, Theoretical Computer Science, vol.290, issue.3, pp.1253-1300, 2003.
DOI : 10.1016/S0304-3975(02)00567-4

J. Engelfriet and H. J. Hoogeboom, X-automata on ??-words, Proceedings of Computer Science Logic, 15th International Workshop, pp.1-51, 1993.
DOI : 10.1016/0304-3975(93)90349-X

]. F. Gir83 and . Gire, Une extension aux mots infinis de la notion de transduction rationelle, Theoretical Computer Science, 6th GI-Conference Proceedings, pp.123-139, 1983.

F. Gire and M. Nivat, Relations rationnelles infinitaires. Calcolo, pp.91-125, 1984.

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

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

]. L. Lan69 and . Landweber, Decision problems for ?-automata, Mathematical Systems Theory, vol.3, issue.4, pp.376-384, 1969.

L. [. Lindner and . Staiger, Algebraische codierungstheorie -Theorie der sequentiellen codierungen, 1977.

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.

]. Pin96 and . Pin, Logic, semigroups and automata on words, Annals of Mathematics and Artificial Intelligence, vol.3, issue.1, pp.343-384, 1996.
DOI : 10.1007/BF02127803

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

]. C. Pri00 and . Prieur, Fonctions Rationnelles de Mots Infinis et Continuité, 2000.

]. V. Sel95 and . Selivanov, Fine hierarchy of regular ?-languages, Proceedings of the International Joint Conference on the Theory and Practice of Software Development TAPSOFT-95, pp.277-287, 1995.

]. V. Sel98 and . Selivanov, Fine hierarchy of regular ?-languages, Theoretical Computer Science, vol.191, pp.37-59, 1998.

]. V. Sel03a and . 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.

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

P. Simonnetsta86-]-l and . Staiger, Automates et théorie descriptive Hierarchies of recursive ?-languages, Handbook of formal languagesSW78] L. Staiger and K. Wagner. Rekursive folgenmengen I. Z. Math Logik Grundlag, pp.5-6219, 1978.

W. Thomas, Automata and quantifier hierarchies, Formal Properties of Finite Automata and Applications Proceedings, pp.104-119, 1987.
DOI : 10.1007/BFb0013115

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

W. Wadge, Reducibility and determinateness in the Baire space, 1983.

K. Wagner, On ??-regular sets, Information and Control, vol.43, issue.2, pp.123-177, 1979.
DOI : 10.1016/S0019-9958(79)90653-3