Recommendations
Cites work
- scientific article; zbMATH DE number 734956 (Why is no real title available?)
- Alternating automata on infinite trees
- Asymptotic Estimates of Stirling Numbers
- Fair simulation
- Partial orders on words, minimal elements of regular languages, and state complexity
- Reasoning about infinite computations
- Temporal logic can be more expressive
- The complementation problem for Büchi automata with applications to temporal logic
- Weak alternating automata are not that weak
Cited in
(33)- A complete characterization of deterministic regular liveness properties
- State of Büchi complementation
- Automata theory and model checking
- -automata
- Büchi complementation made tight
- The Büchi Complementation Saga
- Tight bounds for complementing parity automata
- A tight lower bound for Streett complementation
- Tight upper bounds for Streett and parity complementation
- Progress measures, immediate determinacy, and a subset construction for tree automata
- On the power of finite ambiguity in Büchi complementation
- Modular mix-and-match complementation of Büchi automata
- State of Büchi complementation
- Tools and Algorithms for the Construction and Analysis of Systems
- Tighter Bounds for the Determinisation of Büchi Automata
- Complementing Büchi Automata with Ranker
- Top-down complementation of automata on finite trees
- Automated Technology for Verification and Analysis
- Congruence Relations for Büchi Automata
- scientific article; zbMATH DE number 3922633 (Why is no real title available?)
- Automata-Theoretic Model Checking Revisited
- Profile trees for Büchi word automata, with application to determinization
- On complementing nondeterministic Büchi automata
- Formal Verification of Executable Complementation and Equivalence Checking for Büchi Automata
- Complementation of Emerson-Lei automata
- scientific article; zbMATH DE number 4179361 (Why is no real title available?)
- From complementation to certification
- Unifying Büchi complementation constructions
- scientific article; zbMATH DE number 1701748 (Why is no real title available?)
- Towards a grand unification of Büchi complementation constructions
- Sky is not the limit. Tighter rank bounds for elevator automata in Büchi automata complementation
- Simulations in rank-based Büchi automata complementation
- Multi-Valued Reasoning about Reactive Systems
This page was built for publication: BÜCHI COMPLEMENTATION MADE TIGHTER
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5484906)
