Büchi complementation made tight
From MaRDI portal
Recommendations
Cited in
(45)- Complementing deterministic Büchi automata in polynomial time
- On the complementation of Büchi automata
- Parametric random generation of deterministic tree automata
- -automata
- Certifying inexpressibility
- Complementing semi-deterministic Büchi automata
- Improved Ramsey-based Büchi complementation
- Tight bounds for complementing parity automata
- State of Büchi complementation
- Büchi Store: an open repository of Büchi automata
- State of Büchi complementation
- Automata theory and model checking
- The mu-calculus and Model Checking
- scientific article; zbMATH DE number 4179361 (Why is no real title available?)
- Learning to complement Büchi automata
- The Büchi Complementation Saga
- Büchi Complementation and Size-Change Termination
- Random Generation of Deterministic Tree (Walking) Automata
- Bounded model checking of ETL cooperating with finite and looping automata connectives
- Families of DFAs as acceptors of -regular languages
- Unifying Büchi complementation constructions
- On the power of unambiguity in Büchi complementation
- Rabin vs. Streett automata
- A simple and optimal complementation algorithm for Büchi automata
- Automated Technology for Verification and Analysis
- BÜCHI COMPLEMENTATION MADE TIGHTER
- On complementing nondeterministic Büchi automata
- On the power of finite ambiguity in Büchi complementation
- Towards a grand unification of Büchi complementation constructions
- On the translation of automata to linear temporal logic
- Divide-and-Conquer Determinization of Büchi Automata Based on SCC Decomposition
- Complementing Büchi Automata with Ranker
- Formal Verification of Executable Complementation and Equivalence Checking for Büchi Automata
- Congruence Relations for Büchi Automata
- 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
- Simulations in rank-based Büchi automata complementation
- Singly exponential translation of alternating weak Büchi automata to unambiguous Büchi automata
- Complementation of Emerson-Lei automata
- Singly exponential translation of alternating weak Büchi automata to unambiguous Büchi automata
- A robust measure on FDFAs following duo-normalized acceptance
- Quantitative language automata
- Resolving nondeterminism by chance
- Profile trees for Büchi word automata, with application to determinization
- A tighter analysis of Piterman's Büchi determinization
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)
