On complementing nondeterministic Büchi automata
From MaRDI portal
Recommendations
Cited in
(27)- Complementing unary nondeterministic automata
- Seminator 2 can complement generalized Büchi automata via improved semi-determinization
- From complementation to certification
- Advanced automata minimization
- State of Büchi complementation
- Construction of Büchi Automata for LTL Model Checking Verified in Isabelle/HOL
- Weak alternating automata are not that weak
- The Büchi Complementation Saga
- On minimal odd rankings for Büchi complementation
- Complementation of Büchi Automata Using Alternation
- Determinization and Complementation of Streett Automata
- Tight Bounds for the Determinisation and Complementation of Generalised Büchi Automata
- A simple and optimal complementation algorithm for Büchi automata
- Coinductive algorithms for Büchi automata
- Tools and Algorithms for the Construction and Analysis of Systems
- Automated Technology for Verification and Analysis
- Automata-Theoretic Model Checking Revisited
- From LTL to Symbolically Represented Deterministic Automata
- Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking
- BÜCHI COMPLEMENTATION MADE TIGHTER
- Tools and Algorithms for the Construction and Analysis of Systems
- Towards a grand unification of Büchi complementation constructions
- Modular mix-and-match complementation of Büchi automata
- Sky is not the limit. Tighter rank bounds for elevator automata in Büchi automata complementation
- Efficient normalization of linear temporal logic
- Mediating for reduction (on minimizing alternating Büchi automata)
- A power-set construction for reducing Büchi automata to non-determinism degree two
This page was built for publication: On complementing nondeterministic Büchi automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897059)
