Weak Muller Acceptance Conditions for Tree Automata
No abstract available.
Related papers
- Upper Bound for the Determinization of Emerson-Lei Automata: A One-Fin Approach CAV 2026
- Relational Synthesis of Recursive Programs via Constraint Annotated Tree Automata CAV 2024
- Practical Applications of the Alternating Cycle Decomposition TACAS 2022
- Modular Mix-and-Match Complementation of Büchi Automata TACAS 2023
- Table Compression for Tree Automata TOPLAS 1991
- Verifying Quantum Circuits with Level-Synchronized Tree Automata POPL 2025
- From Spot 2.0 to Spot 2.10: What's New? CAV 2022
- Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis CAV 2013