Author:
Lehtinen Karoliina,Quickert Sandra
Publisher
Springer International Publishing
Reference26 articles.
1. Arnold, A.: The $$\mu $$ -calculus alternation-depth hierarchy is strict on binary trees. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 33(4–5), 329–339 (1999)
2. Bradfield, J.C., Stirling, C.: Modal mu-calculi. Handbook of modal logic 3, 721–756 (2007)
3. Lecture Notes in Computer Science;JC Bradfield,1996
4. Colcombet, T., Kuperberg, D., Löding, C., Vanden Boom, M.: Deciding the weak definability of Büchi definable tree languages. In: LIPIcs-Leibniz International Proceedings in Informatics, vol. 23. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2013)
5. Lecture Notes in Computer Science;T Colcombet,2008
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Descriptive Complexity of Modal μ Model-checking Games;Electronic Proceedings in Theoretical Computer Science;2017-09-06