Author:
Finkel Olivier,Lecomte Dominique,Simonnet Pierre
Subject
Computer Science Applications,General Mathematics,Software
Reference35 articles.
1. A. Arnold, J. Duparc, F. Murlak and D. Niwinski, On the topological complexity of tree languages. In Logic and Automata: History and Perspectives, edited by J. Flum, E. Grädel and T. Wilke. Amsterdam University Press (2007) 9–28.
2. Arnold A. and Niwinski D., Continuous separation of game languages.Fundamenta Informaticae81(2008) 19–28.
3. M. Bojanczyk and T. Place, Regular languages of infinite trees that are boolean combinations of open sets. InProc. of Automata, Languages, and Programming – 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Part II. Edited by A. Czumaj, K. Mehlhorn, A.M. Pitts and R. Wattenhofer. Vol. 7392 ofLect. Notes Comput. Sci.Springer (2012) 104–115.
4. Bradfield J.C., Fixpoints, games and the difference hierarchy.RAIRO: ITA37(2003) 1–15.
5. J.C. Bradfield, J. Duparc and S. Quickert, Transfinite extension of the mu-calculus. InProc. of Computer Science Logic, 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005. Edited by C.-H. Luke Ong. Vol. 3634 ofLect. Notes Comput. Sci.Springer (2005) 384–396.