On the topological complexity of tree languages, Logic and Automata: History and Perspectives, pp.9-28, 2007. ,
Continuous separation of game languages, Fundamenta Informaticae, vol.81, issue.13, pp.19-28, 2008. ,
Transfinite Extension of the Mu-Calculus, Computer Science Logic, 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL Proceedings Automata, Languages , and Programming -39th International Colloquium, ICALP 2012 Proceedings, Part IIBra03] J. C. Bradfield. Fixpoints, games and the difference hierarchy. RAIRO- Theoretical Informatics and Applications, pp.384-396, 2003. ,
DOI : 10.1007/11538363_27
Baire and automata, Discrete Mathematics and Theoretical Computer Science, vol.9, issue.2, pp.255-296, 2007. ,
URL : https://hal.archives-ouvertes.fr/hal-00966518
Abstract, The Journal of Symbolic Logic, vol.1333, issue.01, pp.56-86, 2001. ,
DOI : 10.2307/1971035
The determinacy of context-free games, The Journal of Symbolic Logic, vol.78, issue.4, pp.1115-1134, 2013. ,
Infinite games specified by 2-tape automata. 2013. Preprint, available from http ,
Deciding the Borel Complexity of Regular Tree Languages, Language, Life, Limits -10th Conference on Computability in Europe Proceedings, pp.163-172, 2014. ,
DOI : 10.1007/978-3-319-08019-2_17
On recognizable tree languages beyond the Borel hierarchy, Fundamenta Informaticae, vol.95, issue.2-3, pp.287-303, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-00412638
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
Measure Properties of Game Tree Languages, Mathematical Foundations of Computer Science 2014 -39th International Symposium, MFCS 2014 Proceedings, Part I, pp.303-314, 2014. ,
DOI : 10.1007/978-3-662-44522-8_26
Automata, Logics, and Infinite Games: A Guide to Current Research [outcome of a Dagstuhl seminar, Lecture Notes in Computer Science, vol.2500, 2001. ,
DOI : 10.1007/3-540-36387-4
From Automatic Structures to Borel Structures, 2008 23rd Annual IEEE Symposium on Logic in Computer Science, pp.24-27 ,
DOI : 10.1109/LICS.2008.28
Unambiguous Tree Languages Are Topologically Harder Than Deterministic Ones, Marco Faella and Aniello Murano Proceedings Third International Symposium on Games, Automata Logics and Formal Verification, pp.247-260, 2012. ,
DOI : 10.4204/EPTCS.96.19
Set theory, third edition, 2002. ,
The Higher Infinite, 1997. ,
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. ,
On Topological Completeness of Regular Tree Languages, Logic and Program Semantics -Essays Dedicated to Dexter Kozen on the Occasion of His 60th Birthday, pp.165-179, 2012. ,
DOI : 10.1007/978-3-642-29485-3_11
Descriptive set theory, volume 155 of Mathematical Surveys and Monographs, 2009. ,
The Wadge hierarchy of deterministic tree languages, Logical Methods in Computer Science, vol.4, issue.4 15, 2008. ,
An example of non Borel set of infinite trees recognizable by a Rabin automaton, Polish, 1985. ,
A gap property of deterministic tree languages, Theoretical Computer Science, vol.303, issue.1, pp.215-231, 2003. ,
DOI : 10.1016/S0304-3975(02)00452-8
Infinite words, automata, semigroups, logic and games, Pure and Applied Mathematics, vol.141, 2004. ,
URL : https://hal.archives-ouvertes.fr/hal-00112831
Decidability of second-order theories and automata on infinite trees. Transactions of the, pp.1-35, 1969. ,
Automates et théorie descriptive, 1992. ,
The Borel hierarchy is infinite in the class of regular sets of trees, SR06] J. Saint Raymond. Quasi-bounded trees and analytic inductions, pp.413-418175, 1993. ,
?-languages, Handbook of formal languages, pp.339-387, 1997. ,
Automata on infinite objects Handbook of Theoretical Computer Science, volume B, Formal models and semantics, pp.135-191, 1990. ,
Languages, automata, and logic, Handbook of formal languages, pp.389-455, 1997. ,
Reducibility and determinateness in the Baire space, 1983. ,