Complementation constructions for nondeterministic automata on infinite words
From MaRDI portal
Recommendations
- On complementing nondeterministic Büchi automata
- Automata on infinite words and their applications in formal verification
- On completeness of nondeterministic automata
- Codeterministic automata on infinite words
- Alternating automata and logics over infinite words (extended abstract)
- On an expansion of nondeterministic finite automata
- Complementing unary nondeterministic automata
- On the complexity of infinite words generated by countable \(q\)-automata
- Simplification problems for deterministic pushdown automata on infinite words
Cited in
(10)- A generalization of Cobham's theorem to automata over real numbers
- Construction of Büchi Automata for LTL Model Checking Verified in Isabelle/HOL
- The Büchi Complementation Saga
- Multi-Valued Reasoning about Reactive Systems
- Automated Technology for Verification and Analysis
- BÜCHI COMPLEMENTATION MADE TIGHTER
- Towards a grand unification of Büchi complementation constructions
- Top-down complementation of automata on finite trees
- Complementation of - -regular expressions. I
- Complementation of Emerson-Lei automata
This page was built for publication: Complementation constructions for nondeterministic automata on infinite words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5703760)