Complementing semi-deterministic Büchi automata

DOI10.1007/978-3-662-49674-9_49MaRDI QIDQ2272937zbMATH OpenOpenAlexFDO

Authors František Blahoudek, Matthias Heizmann, Sven Schewe, Jan Strejček, Ming-Hsien Tsai

Publication date 17 September 2019

Full work available at URL https://doi.org/10.1007/978-3-662-49674-9_49

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• A simple and optimal complementation algorithm for Büchi automata
• Seminator 2 can complement generalized Büchi automata via improved semi-determinization
• Complementing deterministic Büchi automata in polynomial time
• Büchi complementation made tight
• Unifying Büchi complementation constructions

Cited in

(16)

• A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
• -automata
• Seminator 2 can complement generalized Büchi automata via improved semi-determinization
• From LTL and limit-deterministic Büchi automata to deterministic parity automata
• Complementation of Büchi Automata Using Alternation
• Determinization and Complementation of Streett Automata
• Families of DFAs as acceptors of -regular languages
• On the power of unambiguity in Büchi complementation
• On the power of finite ambiguity in Büchi complementation
• Certified reinforcement learning with logic guidance
• Divide-and-Conquer Determinization of Büchi Automata Based on SCC Decomposition
• From Spot 2.0 to Spot 2.10: What’s New?
• Complementing Büchi Automata with Ranker
• 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
• Complementation of Emerson-Lei automata

This page was built for publication: Complementing semi-deterministic Büchi automata

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