A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata

DOI10.1007/978-3-642-02930-1_13zbMath1248.68292OpenAlexW1507176903MaRDI QIDQ3638092

Konrad Zdanowski, Thomas Colcombet

Publication date: 14 July 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-02930-1_13

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (6)

The mu-calculus and Model Checking ⋮ On the translation of automata to linear temporal logic ⋮ New Optimizations and Heuristics for Determinization of Büchi Automata ⋮ Unnamed Item ⋮ \( \omega \)-automata ⋮ Rabin vs. Streett Automata

This page was built for publication: A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata