??-Computations on Turing machines, Theoretical Computer Science, vol.6, issue.1, pp.1-23, 1978. ,
DOI : 10.1016/0304-3975(78)90002-6
URL : http://doi.org/10.1016/0304-3975(78)90002-6
Borel ranks and Wadge degrees of omega context free languages, Mathematical Structures in Computer Science, vol.16, issue.5, pp.813-840, 2006. ,
The complexity of infinite computations in models of set theory, Logical Methods in Computer Science, vol.5, issue.44, pp.1-19, 2009. ,
Highly undecidable problems for infinite computations, Theoretical Informatics and Applications, pp.339-364, 2009. ,
Analytic determinacy and 0, Journal of Symbolic Logic, vol.43, issue.4, pp.685-693, 1978. ,
Introduction to automata theory, languages , and computation, 2001. ,
DOI : 10.1145/568438.568455
Set theory, third edition, 2002. ,
Classical descriptive set theory, 1995. ,
The strength of Borel wadge determinacy, Lecture Notes in Mathematics, vol.1333, pp.1-30, 1988. ,
DOI : 10.1007/BFb0084967
Logical specifications of infinite computations, Lecture Notes in Computer Science, vol.803, pp.583-621, 1994. ,
Infinite words, automata, semigroups, logic and games, Pure and Applied Mathematics, vol.141, 2004. ,
URL : https://hal.archives-ouvertes.fr/hal-00112831
?-languages, Handbook of formal languages, pp.339-387, 1997. ,
On the synthesis of strategies in infinite games, Proceedings of the International Conference STACS 1995, pp.1-13, 1995. ,
Church's problem and a tour through automata theory, Pillars of Computer Science, Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday, pp.635-655, 2008. ,
Reducibility and determinateness in the Baire space, 1983. ,
Pushdown processes: games and model checking, Information and Computation, vol.157, pp.234-263, 2000. ,