B. M. , -. Bal, and O. Carton, Determinization of Transducers over Infinite Words, Lect. Notes in Comput. Sci, vol.1853, pp.561-570, 2000.

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, Proc. 1960 Int. Congr. ), pp.1-11, 1962.

C. T. Cachat, J. Duparc, and W. 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. C. Choffrut, Une caracterisation des fonctions sequentielles et des fonctions sous-sequentielles en tant que relations rationnelles, Theoretical Computer Science, vol.5, issue.3, pp.325-338, 1977.
DOI : 10.1016/0304-3975(77)90049-4
URL : http://doi.org/10.1016/0304-3975(77)90049-4

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

G. F. Gire, Une extension aux mots infinis de la notion de transduction rationnelle, Lect. Notes in Comp. Sci, vol.145, pp.123-139, 1983.
DOI : 10.1007/BFb0009639

. A. Kec95 and . Kechris, Classical Descriptive Set Theory, 1995.

S. Borel, The Journal of Symbolic Logic, pp.915-920, 1989.

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

L. 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. R. Lindner and L. Staiger, Algebraische Codierungstheorie -Theorie der Sequentiellen Codierungen, 1977.

P. C. 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. Sta97, Staiger, ?-Languages, Chapter of the Handbook of Formal languages

S. 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

T. W. Thomas, Automata and quantifier hierarchies, Lecture Notes in Computer Science, vol.386, pp.104-119, 1988.
DOI : 10.1007/BFb0013115

T. W. Thomas, Automata on Infinite Objects, Handbook of Theoretical Computer Science, vol.B, pp.133-191, 1990.
DOI : 10.1016/B978-0-444-88074-1.50009-3