Towards a grand unification of Büchi complementation constructions

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Learning regular omega languages
Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
Alternating finite automata on \(\omega\)-words
Profile trees for Büchi word automata, with application to determinization
The complementation problem for Büchi automata with applications to temporal logic
On syntactic congruences for \(\omega\)-languages
Verification of concurrent programs: The automata-theoretic framework
B\"uchi Complementation and Size-Change Termination
Improved Ramsey-Based Büchi Complementation
State of B\"uchi Complementation
Advanced Ramsey-Based Büchi Automata Inclusion Testing
Linear Automaton Transformations
Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
Complementation, Disambiguation, and Determinization of Büchi Automata Unified
Weak alternating automata are not that weak
Efficient Büchi Universality Checking
The Büchi Complementation Saga
On Minimal Odd Rankings for Büchi Complementation
Unifying B\"uchi Complementation Constructions
A Simple and Optimal Complementation Algorithm for Büchi Automata
Büchi Complementation Made Tight
BÜCHI COMPLEMENTATION MADE TIGHTER
Ultimately periodic words of rational ω-languages
Correct Hardware Design and Verification Methods
Model checking of safety properties
Reducing (To) the Ranks: Efficient Rank-Based Büchi Automata Complementation
Congruence Relations for Büchi Automata

This page was built for publication: Towards a grand unification of Büchi complementation constructions