Learning to complement Büchi automata

DOI10.1007/978-3-319-73721-8_15MaRDI QIDQ3296336zbMATH OpenOpenAlexFDO

Authors Yong Li, Andrea Turrini, Sven Schewe, Lijun Zhang

Publication date 7 July 2020

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-73721-8_15

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32)

Recommendations

• State of Büchi complementation
• Büchi complementation made tight
• A simple and optimal complementation algorithm for Büchi automata
• State of Büchi complementation
• On the complementation of Büchi automata

Cited in

(6)

• Learn with SAT to minimize 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
• Modular mix-and-match complementation of Büchi automata
• A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
• Compositional learning for interleaving parallel automata

This page was built for publication: Learning to complement Büchi automata

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