[. Béal and O. Carton, Determinization of Transducers over Infinite Words, Lect. Notes in Comput. Sci, vol.1853, pp.561-570, 2000.
DOI : 10.1007/3-540-45022-X_47

[. 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. Berstel, Transductions and Context Free Languages, 1979.
DOI : 10.1007/978-3-663-09367-1

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

J. R. Büchi, On a Decision Method in Restricted Second Order Arithmetic , Logic Methodology and Philosophy of Science, Proc. 1960 Int. Congr. ), pp.1-11, 1962.

J. [. Cachat, W. Duparc, and . Thomas, Solving Pushdown Games with a ???3 Winning Condition, Lecture Notes in Computer Science, vol.2471, pp.322-336, 2002.
DOI : 10.1007/3-540-45793-3_22

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

]. C. Cho77 and . Choffrut, Une Caractérisation des Fonctions Séquentielles et des Fonctions Sous-Séquentielles en tant que Relations Rationnelles, Theoretical Computer Science, vol.5, pp.325-338, 1977.

S. [. Choffrut and . Grigorieff, Uniformization of Rational Relations, Jewels are Forever, pp.59-71, 1999.

]. O. Fin01 and . Finkel, Topological Properties of Omega Context Free Languages, Theoretical Computer Science, vol.262, issue.12, pp.669-697, 2001.

]. O. Fin03a and . Finkel, On the Topological Complexity of Infinitary Rational Relations, RAIRO-Theoretical Informatics and Applications, pp.105-113, 2003.

]. O. Fin03b and . Finkel, Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations, RAIRO-Theoretical Informatics and Applications, pp.115-126, 2003.

]. O. Fin03c and . Finkel, On Infinitary Rational Relations and Borel Sets, the Proceedings of the Fourth International Conference on Discrete Mathematics and Theoretical Computer Science DMTCS'03, pp.155-167, 2003.

]. O. Fin05 and . Finkel, Borel Ranks and Wadge Degrees of Omega Context Free Languages, in the Proceedings of New Computational Paradigms: First Conference on Computability in Europe, CiE Lecture Notes in Computer Science, vol.3526, pp.129-138, 2005.

]. F. Gir83 and . Gire, Une Extension aux Mots Infinis de la Notion de Transduction Rationnelle, 6th GI Conf, Lecture Notes in Computer Science, vol.145, pp.123-139, 1983.

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

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.

L. [. Lindner and . Staiger, Algebraische Codierungstheorie -Theorie der Sequentiellen Codierungen, 1977.

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

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é, Thèse de Doctorat, 2000.

]. P. Sim92 and . Simonnet, Automates et Théorie Descriptive, Thèse de Doctorat, 1992.

]. L. Sta86 and . Staiger, Hierarchies of Recursive ?-Languages, Jour. Inform. Process . Cybernetics EIK, vol.226, issue.5, pp.219-241, 1986.

L. Staiger, Chapter of the Handbook of Formal languages

L. Staiger, K. Wagner, R. Folgenmengen, I. , and Z. , 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. Tho89 and . Thomas, Automata and Quantifier Hierarchies, in: Formal Properties of Finite automata and Applications, Ramatuelle, Lecture Notes in Computer Science, vol.386, pp.104-119, 1988.

]. W. Tho90 and . Thomas, Automata on Infinite Objects, Handbook of Theoretical Computer Science, vol.B, pp.133-191, 1990.