Improved Ramsey-based Büchi complementation

DOI10.1007/978-3-642-28729-9_10MaRDI QIDQ2892768zbMATH OpenOpenAlexFDO

Authors Stefan Breuers, Christof Löding, J. Olschewski

Publication date 22 June 2012

Published in Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-28729-9_10

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• State of Büchi complementation
• State of Büchi complementation
• Büchi complementation made tight
• A simple and optimal complementation algorithm for Büchi automata
• Büchi complementation and size-change termination

Cited in

(17)

• -automata
• Büchi complementation and size-change termination
• Ramsey-based analysis of parity automata
• State of Büchi complementation
• State of Büchi complementation
• Automata theory and model checking
• Efficient Büchi universality checking
• Multi-Valued Reasoning about Reactive Systems
• Ramsey-based inclusion checking for visibly pushdown automata
• Towards a grand unification of Büchi complementation constructions
• Complementing Büchi Automata with Ranker
• 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
• Disjointness, inclusion, and regularity of -rational trace languages (extended abstract)
• Complementation of Emerson-Lei automata

This page was built for publication: Improved Ramsey-based Büchi complementation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892768)