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
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, 1979. ,
DOI : 10.1007/978-3-663-09367-1
URL : https://hal.archives-ouvertes.fr/hal-00619779
On a Decision Method in Restricted Second Order Arithmetic , Logic Methodology and Philosophy of Science, Proc. 1960 Int. Congr. ), pp.1-11, 1962. ,
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
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. ,
Uniformization of Rational Relations, Jewels are Forever, pp.59-71, 1999. ,
Topological Properties of Omega Context Free Languages, Theoretical Computer Science, vol.262, issue.12, pp.669-697, 2001. ,
On the Topological Complexity of Infinitary Rational Relations, RAIRO-Theoretical Informatics and Applications, pp.105-113, 2003. ,
Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations, RAIRO-Theoretical Informatics and Applications, pp.115-126, 2003. ,
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. ,
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. ,
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. ,
Decision problems for??-automata, Mathematical Systems Theory, vol.9, issue.4, pp.376-384, 1969. ,
DOI : 10.1007/BF01691063
A Decade of Concurrency, Logical Specifications of Infinite Computations Lecture Notes in Computer Science, vol.803, pp.583-621, 1994. ,
Algebraische Codierungstheorie -Theorie der Sequentiellen Codierungen, 1977. ,
Descriptive Set Theory, North-Holland, 1980. ,
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é, Thèse de Doctorat, 2000. ,
Automates et Théorie Descriptive, Thèse de Doctorat, 1992. ,
Hierarchies of Recursive ?-Languages, Jour. Inform. Process . Cybernetics EIK, vol.226, issue.5, pp.219-241, 1986. ,
Chapter of the Handbook of Formal languages ,
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
Automata and Quantifier Hierarchies, in: Formal Properties of Finite automata and Applications, Ramatuelle, Lecture Notes in Computer Science, vol.386, pp.104-119, 1988. ,
Automata on Infinite Objects, Handbook of Theoretical Computer Science, vol.B, pp.133-191, 1990. ,