The Theory of hierarchies, Proc. 1960 International Congress, pp.26-37, 1962. ,
The Method of Alterning Chains. The Theory of Models, North Holland Amsterdam, pp.1-16, 1965. ,
Topological characterizations of infinite behaviours of transition systems, Lecture Notes in Comput. Sci. vol, vol.154, pp.28-38, 1983. ,
DOI : 10.1007/BFb0036895
Comportement de Processus . Colloque AFCET Les mathématiques de l'informatique,France, pp.35-68, 1982. ,
Oeuvres scientifiques . Bordas, 1990. ,
Hausdroff-Kuratowski hierarchy of ? -regular languages and a hierarchy of Muller automata, Theoretical Computer Science, vol.16, issue.1, pp.60-99, 1992. ,
Finite Automata, Behaviour and Synthesis, 1973. ,
Determinization of transducers over finite and infinite words Theoret, Comput. Sci, vol.289, issue.1, pp.225-251, 2002. ,
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
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
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
Transductions and Context Free Languages, 1979. ,
DOI : 10.1007/978-3-663-09367-1
URL : https://hal.archives-ouvertes.fr/hal-00619779
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
On a decision method in restricted second order arithmetic. Logic, Methodology and Philosophy of Science, pp.1-11, 1962. ,
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
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
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
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
Chapter 7 of M. Lothaire, Algebraic Combinatorics on Words, 2002. ,
Automata Borel functions and real numbers in Pisot basis . 6th conference on real numbers and computers (RNC6), 2004. ,
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
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
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
Uniformization of Rational Relations. Jewels are Forever, pp.59-71, 1999. ,
Histoire de l'analyse. Vuibert, pp.253-271, 2003. ,
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
Abstract, The Journal of Symbolic Logic, vol.1333, issue.01, pp.56-86, 2001. ,
DOI : 10.2307/1971035
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
Automata, Languages and Machines Vol A, 1974. ,
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
Simonnet On Infinite Real Trace Rational Languages of Maximum Topological Complexity, Zapiski Nauchnyh Seminarov POMI, vol.316, pp.205-223, 2004. ,
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
On-the-fly algorithms and sequential machines, IEEE Transactions on Computers, vol.49, issue.8, pp.859-863, 2000. ,
DOI : 10.1109/12.868030
Numeration Systems Chapter 8 of M. Lothaire, Algebraic Combinatorics on Words, 2002. ,
Relation rationnelles infinitaires . Calcolo XXI, pp.91-125, 1984. ,
Two decidability Problems for infinite words Information Processing letters 22, pp.135-140, 1986. ,
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
On the Boolean Closure of Buchi Tree Automaton Definable Set of ?-trees, Aachener Inform. Ber., Nr, vol.87, 1987. ,
On the Topological Classification of Degeneracies. Informatik- Berichte, Nr. 154, FernUniversität, 1994. ,
Relativ perfekte Teile von Punktmengen und Mengen, Fund. Math, vol.12, pp.78-109, 1928. ,
A classification of ??-regular languages, Theoretical Computer Science, vol.36, pp.2-3, 1985. ,
DOI : 10.1016/0304-3975(85)90043-X
Classical Descriptive Set Theory, 1995. ,
DOI : 10.1007/978-1-4612-4190-4
Descriptive Set Theory and the Structure of Sets of Uniqueness, 1987. ,
DOI : 10.1017/CBO9780511758850
A Classification of Baire class 1 functions, Trans. AMS, vol.318, issue.1, pp.209-236, 1990. ,
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
Digit-set conversions: generalizations and applications, IEEE Transactions on Computers, vol.43, issue.5, pp.622-629, 1994. ,
DOI : 10.1109/12.280811
Une méthode d'´ elimination des nombres transfinis des raisonnements mathématiques . Fund ,
Decision problems for??-automata, Mathematical Systems Theory, vol.9, issue.4, pp.376-384, 1969. ,
DOI : 10.1007/BF01691063
Rational omega-Transductions, MFCS, pp.407-415, 1990. ,
Algebraische Codierungstheorie -Theorie der sequentiellen Codierungen, 1977. ,
A separation theorem for ? 1 1 sets. Transaction A, pp.363-378, 1981. ,
Some results in the Wadge Hierarchy of Borel Sets. Cabals Sem, pp.79-81, 1983. ,
Quantificateur de jeu et ?-ideal of compacts. Séminaire de theorie effective Unversité Paris VI, 1987. ,
Borel classes and closed games Wadge-type and Hurewicztype results. Transaction A.M.S. 304, pp.431-437, 1987. ,
Les propriétés de réduction et de norme pour les classes de Boreliens, Fundamenta Mathematica, vol.131, pp.223-437, 1988. ,
Descriptive Set Theory, 1980. ,
DOI : 10.1090/surv/155
Arithmétique des ordinateurs, 1989. ,
An Example of Non Borel Set of infinite Trees Recognizable by a Rabin Automaton, 1985. ,
On the complexity of infinite computations. Automata, Structures and Logic, 2004. ,
Infinite words, 2004. ,
URL : https://hal.archives-ouvertes.fr/hal-00620767
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
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
Decidability of Second Order Theories and Automata on Infinite Tree, Trans. Amer. Math. Soc, vol.141, pp.1-35, 1969. ,
Weakly Definable Relations and Special Automata Mathematical Logic and Foundations of Set Theory, pp.1-23, 1970. ,
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
Theory of Recursive Functions and Effective Computability, 1967. ,
BoréliensBoréliens`Boréliensà coupe K ?, Bull. Soc. Math. France, vol.104, pp.1-23, 1976. ,
Classification de Wadge Note d'exposé, fev 1989, Séminaire InitiationàInitiation`Initiationà l'Analyse, 1989. ,
Eléments de théorie des automates. Vuibert informatique, 2003. ,
Fine hierarchy of regular ?-languages, Theoret. Comput, vol.191, pp.1-2, 1998. ,
The Monadic Theory of Order, The Annals of Mathematics, vol.102, issue.3, pp.379-419, 1975. ,
DOI : 10.2307/1971037
Sur les fonctions depremì ere classe, C. R. Acad. Sci. Paris, vol.170, pp.919-922, 1920. ,
Automate et théorie descriptive, 1992. ,
Un théorème de séparation sur les ensembles rationnels de mots infinis, C. R. Acad. Sci, pp.201-203, 1993. ,
Automates d'arbres infinis et choix borélien, C. R. Acad. Sci, p.316 ,
The Borel Hierarchy is Infinite in the Class of Regular Sets of Trees, LNCS, vol.380, pp.416-423, 1989. ,
A course on Borel Sets, 1998. ,
DOI : 10.1007/978-3-642-85473-6
Hierarchies of Recursive ?-languages, J. Inf. Process. Cybern. EIK, vol.22, issue.5, pp.219-241, 1986. ,
Research in the Theory of ?-languages, J. Inf. Process. Cybern. EIK, vol.23, issue.8, pp.415-439, 1987. ,
Sequential mappings of ?-languages. RAIRO -Inform, Theor. Appl, vol.21, issue.2, pp.147-173, 1987. ,
Recursive automata on infinite words, STACS, 1993. ,
DOI : 10.1007/3-540-56503-5_62
?-languages. Chapter of the handbook of Formal Languages, pp.201-203, 1997. ,
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. ,
Determinateness and the separation property, The Journal of Symbolic Logic, vol.43, issue.01, pp.41-44, 1981. ,
DOI : 10.2307/2273254
Automata on infinite objects. Handbook of theoretical computer science, 1990. ,
Logical specifications of infinite computations, 1994. ,
DOI : 10.1007/3-540-58043-3_29
On the synthesis of strategies in infinite games, STACS, vol.95, pp.1-13, 1995. ,
DOI : 10.1007/3-540-59042-0_57
Languages Automata and Logic . Handbook of Formal Languages, pp.389-449, 1997. ,
Finite Automata and the Monadique Predicare Calculus, Sibirsk. Mat. Zh, vol.3, issue.1, pp.103-131, 1962. ,
Finite Automata. North-Holland, 1973. ,
Wesep Separation principes and the axiom of determinateness, J. of Symb. Logic, vol.43, pp.77-81, 1978. ,
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
Degrees of complexity of subsets of the Baire space, Notice A.M.S, 1972. ,
On ? -regular Sets. Information and Control 43, pp.123-177, 1979. ,
Recursive ?-languages. Fundamentals of Computation Theory, LNCS, vol.56, pp.532-537, 1977. ,
The lowest Wadge degrees of subsets of the Cantor space. Informatik-Berichte Nr.107, FernUniversität, 1991. ,
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