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
Transductions and context free languages, Teubner Studienbücher Informatik, 1979. ,
Finite automata, behaviour and synthesis, 1970. ,
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
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
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
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
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
X-automata on ??-words, Proceedings of Computer Science Logic, 15th International Workshop, pp.1-51, 1993. ,
DOI : 10.1016/0304-3975(93)90349-X
Une extension aux mots infinis de la notion de transduction rationelle, Theoretical Computer Science, 6th GI-Conference Proceedings, pp.123-139, 1983. ,
Relations rationnelles infinitaires. Calcolo, pp.91-125, 1984. ,
Set theory, third edition, 2002. ,
Classical descriptive set theory, 1995. ,
Decision problems for ?-automata, Mathematical Systems Theory, vol.3, issue.4, pp.376-384, 1969. ,
Algebraische codierungstheorie -Theorie der sequentiellen codierungen, 1977. ,
Logical specifications of infinite computations, Lecture Notes in Computer Science, vol.803, pp.583-621, 1994. ,
Descriptive set theory, 1980. ,
Logic, semigroups and automata on words, Annals of Mathematics and Artificial Intelligence, vol.3, issue.1, pp.343-384, 1996. ,
DOI : 10.1007/BF02127803
Infinite words, automata, semigroups, logic and games, Pure and Applied Mathematics, vol.141, 2004. ,
URL : https://hal.archives-ouvertes.fr/hal-00112831
Fonctions Rationnelles de Mots Infinis et Continuité, 2000. ,
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. ,
Fine hierarchy of regular ?-languages, Theoretical Computer Science, vol.191, pp.37-59, 1998. ,
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. ,
Wadge degrees of ?-languages of deterministic Turing machines, RAIRO-Theoretical Informatics and Applications, pp.67-83, 2003. ,
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. ,
Automata and quantifier hierarchies, Formal Properties of Finite Automata and Applications Proceedings, pp.104-119, 1987. ,
DOI : 10.1007/BFb0013115
Automata on infinite objects Handbook of Theoretical Computer Science, volume B, Formal models and semantics, pp.135-191, 1990. ,
Reducibility and determinateness in the Baire space, 1983. ,
On ??-regular sets, Information and Control, vol.43, issue.2, pp.123-177, 1979. ,
DOI : 10.1016/S0019-9958(79)90653-3