Büchi complementation made tight
From MaRDI portal
Recommendations
Cited in
(43)- Certifying inexpressibility
- State of Büchi complementation
- Automata theory and model checking
- -automata
- Singly exponential translation of alternating weak Büchi automata to unambiguous Büchi automata
- The Büchi Complementation Saga
- Tight bounds for complementing parity automata
- Büchi Complementation and Size-Change Termination
- On the power of finite ambiguity in Büchi complementation
- Modular mix-and-match complementation of Büchi automata
- State of Büchi complementation
- Complementing Büchi Automata with Ranker
- Divide-and-Conquer Determinization of Büchi Automata Based on SCC Decomposition
- A tighter analysis of Piterman's Büchi determinization
- Families of DFAs as acceptors of -regular languages
- A simple and optimal complementation algorithm for Büchi automata
- Automated Technology for Verification and Analysis
- Congruence Relations for Büchi Automata
- Random Generation of Deterministic Tree (Walking) Automata
- The mu-calculus and Model Checking
- Complementing semi-deterministic Büchi automata
- BÜCHI COMPLEMENTATION MADE TIGHTER
- A robust measure on FDFAs following duo-normalized acceptance
- Rabin vs. Streett automata
- Büchi Store: an open repository of Büchi automata
- Bounded model checking of ETL cooperating with finite and looping automata connectives
- Profile trees for Büchi word automata, with application to determinization
- On complementing nondeterministic Büchi automata
- On the complementation of Büchi automata
- Unifying Büchi complementation constructions
- Parametric random generation of deterministic tree automata
- Formal Verification of Executable Complementation and Equivalence Checking for Büchi Automata
- Improved Ramsey-based Büchi complementation
- Complementation of Emerson-Lei automata
- scientific article; zbMATH DE number 4179361 (Why is no real title available?)
- Towards a grand unification of Büchi complementation constructions
- Singly exponential translation of alternating weak Büchi automata to unambiguous Büchi automata
- Sky is not the limit. Tighter rank bounds for elevator automata in Büchi automata complementation
- Simulations in rank-based Büchi automata complementation
- On the translation of automata to linear temporal logic
- Learning to complement Büchi automata
- Complementing deterministic Büchi automata in polynomial time
- scientific article; zbMATH DE number 7455748 (Why is no real title available?)
This page was built for publication: Büchi complementation made tight
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5390016)
