A simple and optimal complementation algorithm for Büchi automata
From MaRDI portal
Publication:5145275
DOI10.1145/3209108.3209138zbMATH Open1497.68246OpenAlexW2798623107MaRDI QIDQ5145275FDOQ5145275
Authors: Joel D. Allred, Ulrich Ultes-Nitsche 
Publication date: 20 January 2021
Published in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3209108.3209138
Recommendations
Cited In (16)
- Complementation of Büchi Automata Using Alternation
- State of Büchi complementation
- Büchi complementation made tight
- Modular mix-and-match complementation of Büchi automata
- State of Büchi complementation
- Complementing Büchi Automata with Ranker
- One-pass and tree-shaped tableau systems for TPTL and \(\mathrm{TPTL_b+Past}\)
- Congruence Relations for Büchi Automata
- On complementing nondeterministic Büchi automata
- Improved complement for two-way alternating automata
- On the complementation of Büchi automata
- Improved Ramsey-based Büchi complementation
- 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
- Complementing deterministic Büchi automata in polynomial time
This page was built for publication: A simple and optimal complementation algorithm for Büchi automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145275)
