J. W. Addison, The Theory of hierarchies, Proc. 1960 International Congress, pp.26-37, 1962.

J. W. Addison, The Method of Alterning Chains. The Theory of Models, North Holland Amsterdam, pp.1-16, 1965.

A. Arnold, Topological characterizations of infinite behaviours of transition systems, Lecture Notes in Comput. Sci. vol, vol.154, pp.28-38, 1983.
DOI : 10.1007/BFb0036895

A. Arnold and M. Nivat, Comportement de Processus . Colloque AFCET Les mathématiques de l'informatique,France, pp.35-68, 1982.

R. Baire, Oeuvres scientifiques . Bordas, 1990.

R. Barua, Hausdroff-Kuratowski hierarchy of ? -regular languages and a hierarchy of Muller automata, Theoretical Computer Science, vol.16, issue.1, pp.60-99, 1992.

Y. M. Barzdin and B. A. Trakhtenbrot, Finite Automata, Behaviour and Synthesis, 1973.

M. P. Béal and O. Carton, Determinization of transducers over finite and infinite words Theoret, Comput. Sci, vol.289, issue.1, pp.225-251, 2002.

M. P. 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

N. Bedon, Finite automata and ordinals, Theoretical Computer Science, vol.156, issue.1-2, pp.1-2, 1996.
DOI : 10.1016/0304-3975(95)00006-2

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

A. Bergeron and J. C. Manzoni, An Automated Analysis of Ping-Pong Interactions in E-Mail Services, TACAS'99 Proceedings, pp.134-147, 1999.
DOI : 10.1007/3-540-49059-0_10

J. Berstel, Transductions and Context Free Languages, 1979.
DOI : 10.1007/978-3-663-09367-1

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

L. Boasson and M. Nivat, Adherences of languages, Journal of Computer and System Sciences, vol.20, issue.3, pp.285-309, 1980.
DOI : 10.1016/0022-0000(80)90010-0

J. R. Büchi, On a decision method in restricted second order arithmetic. Logic, Methodology and Philosophy of Science, pp.1-11, 1962.

J. R. Büchi and D. Siefkes, The monadic second order theory of ??1, Lecture Notes in math, vol.76, pp.1-121, 1973.
DOI : 10.1007/978-3-662-36678-3

J. R. Büchi, Using determinancy of games to eliminate quantifiers, Lecture Notes in Comput. Sci, vol.56, pp.367-378, 1977.
DOI : 10.1007/3-540-08442-8_104

J. R. Büchi, State-Strategies for Games in F ???? ??? G ????, J. Symbolic Logic, vol.48, issue.4, pp.1171-1198, 1984.
DOI : 10.1007/978-1-4613-8928-6_33

J. R. Büchi and L. H. Landweber, Solving sequential conditions by finite-state strategies, Transactions of the American Mathematical Society, vol.138, pp.295-311, 1969.
DOI : 10.1090/S0002-9947-1969-0280205-0

V. Bruyère and . Codes, Chapter 7 of M. Lothaire, Algebraic Combinatorics on Words, 2002.

B. Cagnard and . Simonnet, Automata Borel functions and real numbers in Pisot basis . 6th conference on real numbers and computers (RNC6), 2004.

O. Carton and M. Michel, Unambiguous Büchi automata, Theoret. Comput. Sci, vol.297, issue.37, p.81, 2003.
DOI : 10.1007/10719839_40

URL : http://dx.doi.org/10.1016/s0304-3975(02)00618-7

O. Carton and D. Perrin, THE WAGNER HIERARCHY, International Journal of Algebra and Computation, vol.09, issue.05, pp.597-620, 1999.
DOI : 10.1142/S0218196799000357

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

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

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

P. Dugac, Histoire de l'analyse. Vuibert, pp.253-271, 2003.

J. Duparc, O. Finkel, and J. P. Ressayre, Computer science and the fine structure of Borel sets, Theoretical Computer Science, vol.257, issue.1-2, pp.85-105, 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

S. Eilenberg, Automata, Languages and Machines Vol A, 1974.

C. C. Elgot and J. E. Mezei, On Relations Defined by Generalized Finite Automata, IBM Journal of Research and Development, vol.9, issue.1, pp.47-68, 1965.
DOI : 10.1147/rd.91.0047

O. Finkel, J. P. Ressayre, and P. , Simonnet On Infinite Real Trace Rational Languages of Maximum Topological Complexity, Zapiski Nauchnyh Seminarov POMI, vol.316, pp.205-223, 2004.

C. Frougny and J. Sakarovitch, Synchronized rational relations of finite and infinite words, Theoretical Computer Science, vol.108, issue.1, pp.45-82, 1993.
DOI : 10.1016/0304-3975(93)90230-Q

C. Frougny, On-the-fly algorithms and sequential machines, IEEE Transactions on Computers, vol.49, issue.8, pp.859-863, 2000.
DOI : 10.1109/12.868030

C. Frougny, Numeration Systems Chapter 8 of M. Lothaire, Algebraic Combinatorics on Words, 2002.

F. Gire and . Nivat, Relation rationnelles infinitaires . Calcolo XXI, pp.91-125, 1984.

F. Gire, Two decidability Problems for infinite words Information Processing letters 22, pp.135-140, 1986.

Y. Gurevitch and L. Harrington, Trees, automata, and games, Proceedings of the fourteenth annual ACM symposium on Theory of computing , STOC '82, pp.60-65, 1982.
DOI : 10.1145/800070.802177

T. Hafer, On the Boolean Closure of Buchi Tree Automaton Definable Set of ?-trees, Aachener Inform. Ber., Nr, vol.87, 1987.

P. Hertling and . Weihrauch, On the Topological Classification of Degeneracies. Informatik- Berichte, Nr. 154, FernUniversität, 1994.

W. Hurewicz, Relativ perfekte Teile von Punktmengen und Mengen, Fund. Math, vol.12, pp.78-109, 1928.

M. Kaminski, A classification of ??-regular languages, Theoretical Computer Science, vol.36, pp.2-3, 1985.
DOI : 10.1016/0304-3975(85)90043-X

A. S. Kechris, Classical Descriptive Set Theory, 1995.
DOI : 10.1007/978-1-4612-4190-4

A. S. Kechris and A. Louveau, Descriptive Set Theory and the Structure of Sets of Uniqueness, 1987.
DOI : 10.1017/CBO9780511758850

A. S. Kechris and A. Louveau, A Classification of Baire class 1 functions, Trans. AMS, vol.318, issue.1, pp.209-236, 1990.

A. S. Kechris, A. Louveau, and W. H. Woodin, The Structure of ??-Ideals of Compact Sets, Transactions of the American Mathematical Society, vol.301, issue.1, pp.263-288, 1987.
DOI : 10.2307/2000338

P. Kornerup, Digit-set conversions: generalizations and applications, IEEE Transactions on Computers, vol.43, issue.5, pp.622-629, 1994.
DOI : 10.1109/12.280811

C. Kuratowski, Une méthode d'´ elimination des nombres transfinis des raisonnements mathématiques . Fund

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

M. Latteux and E. Timmerman, Rational omega-Transductions, MFCS, pp.407-415, 1990.

R. Lindner and L. Staiger, Algebraische Codierungstheorie -Theorie der sequentiellen Codierungen, 1977.

A. Louveau, A separation theorem for ? 1 1 sets. Transaction A, pp.363-378, 1981.

A. Louveau, Some results in the Wadge Hierarchy of Borel Sets. Cabals Sem, pp.79-81, 1983.

A. Louveau, Quantificateur de jeu et ?-ideal of compacts. Séminaire de theorie effective Unversité Paris VI, 1987.

A. Louveau and J. Raymond, Borel classes and closed games Wadge-type and Hurewicztype results. Transaction A.M.S. 304, pp.431-437, 1987.

A. Louveau and J. Raymond, Les propriétés de réduction et de norme pour les classes de Boreliens, Fundamenta Mathematica, vol.131, pp.223-437, 1988.

Y. N. Moschovakis, Descriptive Set Theory, 1980.
DOI : 10.1090/surv/155

J. M. Muller, Arithmétique des ordinateurs, 1989.

D. Niwinski, An Example of Non Borel Set of infinite Trees Recognizable by a Rabin Automaton, 1985.

D. Niwinski, On the complexity of infinite computations. Automata, Structures and Logic, 2004.

D. Perrin and J. E. Pin, Infinite words, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00620767

C. Prieur, How to decide continuity of rational functions on infinite words, Theoretical Computer Science, vol.250, issue.1-2, pp.71-82, 2001.
DOI : 10.1016/S0304-3975(99)00115-2

C. Prieur, How to decide continuity of rational functions on infinite words, Theoretical Computer Science, vol.276, issue.1-2, pp.445-447, 2002.
DOI : 10.1016/S0304-3975(01)00307-3

M. O. Rabin, Decidability of Second Order Theories and Automata on Infinite Tree, Trans. Amer. Math. Soc, vol.141, pp.1-35, 1969.

M. O. Rabin, Weakly Definable Relations and Special Automata Mathematical Logic and Foundations of Set Theory, pp.1-23, 1970.

M. O. Rabin and D. Scott, Finite Automata and Their Decision Problems, IBM Journal of Research and Development, vol.3, issue.2, pp.114-125, 1959.
DOI : 10.1147/rd.32.0114

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

J. Raymond, BoréliensBoréliens`Boréliensà coupe K ?, Bull. Soc. Math. France, vol.104, pp.1-23, 1976.

J. Saint-raymond, G. Choquet, G. Godefroy, M. Rogalski, and J. , Classification de Wadge Note d'exposé, fev 1989, Séminaire InitiationàInitiation`Initiationà l'Analyse, 1989.

J. Sakarovitch, Eléments de théorie des automates. Vuibert informatique, 2003.

V. Selivanov, Fine hierarchy of regular ?-languages, Theoret. Comput, vol.191, pp.1-2, 1998.

S. Shelah, The Monadic Theory of Order, The Annals of Mathematics, vol.102, issue.3, pp.379-419, 1975.
DOI : 10.2307/1971037

W. Sierpinski, Sur les fonctions depremì ere classe, C. R. Acad. Sci. Paris, vol.170, pp.919-922, 1920.

P. Simonnet, Automate et théorie descriptive, 1992.

P. Simonnet, Un théorème de séparation sur les ensembles rationnels de mots infinis, C. R. Acad. Sci, pp.201-203, 1993.

P. Simonnet, Automates d'arbres infinis et choix borélien, C. R. Acad. Sci, p.316

J. Skurczynski, The Borel Hierarchy is Infinite in the Class of Regular Sets of Trees, LNCS, vol.380, pp.416-423, 1989.

S. M. Srivastava, A course on Borel Sets, 1998.
DOI : 10.1007/978-3-642-85473-6

L. Staiger, Hierarchies of Recursive ?-languages, J. Inf. Process. Cybern. EIK, vol.22, issue.5, pp.219-241, 1986.

L. Staiger, Research in the Theory of ?-languages, J. Inf. Process. Cybern. EIK, vol.23, issue.8, pp.415-439, 1987.

L. Staiger, Sequential mappings of ?-languages. RAIRO -Inform, Theor. Appl, vol.21, issue.2, pp.147-173, 1987.

L. Staiger, Recursive automata on infinite words, STACS, 1993.
DOI : 10.1007/3-540-56503-5_62

L. Staiger, ?-languages. Chapter of the handbook of Formal Languages, pp.201-203, 1997.

L. Staiger and K. , Weihrauch In the Cantor Space and the Baire Space, G ? \F s igma is a Single Wadge-Degree, an effective proof. Informatik-Berichte Nr, 1992.

J. R. Steel, Determinateness and the separation property, The Journal of Symbolic Logic, vol.43, issue.01, pp.41-44, 1981.
DOI : 10.2307/2273254

W. Thomas, Automata on infinite objects. Handbook of theoretical computer science, 1990.

W. H. Thomas and . Lescow, Logical specifications of infinite computations, 1994.
DOI : 10.1007/3-540-58043-3_29

W. Thomas, On the synthesis of strategies in infinite games, STACS, vol.95, pp.1-13, 1995.
DOI : 10.1007/3-540-59042-0_57

W. Thomas, Languages Automata and Logic . Handbook of Formal Languages, pp.389-449, 1997.

B. A. Trakhtenbrot, Finite Automata and the Monadique Predicare Calculus, Sibirsk. Mat. Zh, vol.3, issue.1, pp.103-131, 1962.

B. A. Trakhtenbrot and Y. M. Barzdin, Finite Automata. North-Holland, 1973.

R. Van, Wesep Separation principes and the axiom of determinateness, J. of Symb. Logic, vol.43, pp.77-81, 1978.

O. Veblen, Continuous increasing functions of finite and transfinite ordinals, Transactions of the American Mathematical Society, vol.9, issue.3, pp.280-292, 1908.
DOI : 10.1090/S0002-9947-1908-1500814-9

W. W. Wadge, Degrees of complexity of subsets of the Baire space, Notice A.M.S, 1972.

K. Wagner, On ? -regular Sets. Information and Control 43, pp.123-177, 1979.

K. L. Wagner and . Staiger, Recursive ?-languages. Fundamentals of Computation Theory, LNCS, vol.56, pp.532-537, 1977.

K. Weihrauch, The lowest Wadge degrees of subsets of the Cantor space. Informatik-Berichte Nr.107, FernUniversität, 1991.

T. Wilke, AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS, International Journal of Algebra and Computation, vol.03, issue.04, pp.447-489, 1993.
DOI : 10.1142/S0218196793000287