Subject
General Computer Science,Theoretical Computer Science
Reference32 articles.
1. An initial semantics of the μ-calculus on trees and Rabin's complementation theorem;Arnold;Theoret. Comput. Sci.,1994
2. The Classical Decision Problems;Börger,1997
3. Using determinacy to eliminate quantifiers;Büchi,1997
4. State-strategies for games in Fσδ ∩ Gδσ;Büchi;J. Symbol. Logic,1983
5. Infinite games of perfect information;Davis,1964
Cited by
306 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Priority Promotion with Parysian flair;Journal of Computer and System Sciences;2025-02
2. Half-Positional Objectives Recognized by Deterministic B\"uchi Automata;Logical Methods in Computer Science;2024-08-29
3. ω-Regular Energy Problems;Formal Aspects of Computing;2024-07-17
4. Deterministic Sub-exponential Algorithm for Discounted-sum Games with Unary Weights;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
5. Contract-Based Distributed Logical Controller Synthesis;Proceedings of the 27th ACM International Conference on Hybrid Systems: Computation and Control;2024-05-14