Lower Bounds for Complementation of ω-Automata Via the Full Automata Technique

DOI10.1007/11787006_50zbMath1134.68031OpenAlexW1548816955MaRDI QIDQ3591446

Qiqi Yan

Publication date: 11 September 2007

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11787006_50

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (7)

Automata Theory and Model Checking ⋮ Multi-Valued Reasoning about Reactive Systems ⋮ Complexity of Topological Properties of Regular ω-Languages ⋮ The Quest for a Tight Translation of Büchi to co-Büchi Automata ⋮ Automata-Theoretic Model Checking Revisited ⋮ Unnamed Item ⋮ \( \omega \)-automata

This page was built for publication: Lower Bounds for Complementation of ω-Automata Via the Full Automata Technique