Complementing semi-deterministic Büchi automata

DOI10.1007/978-3-662-49674-9_49zbMath1420.68106OpenAlexW2501722818MaRDI QIDQ2272937

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

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)

Related Items (7)

On the power of finite ambiguity in Büchi complementation ⋮ Certified reinforcement learning with logic guidance ⋮ Unnamed Item ⋮ From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata ⋮ A novel learning algorithm for Büchi automata based on family of DFAs and classification trees ⋮ Unnamed Item ⋮ \( \omega \)-automata

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