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

Thomas Colcombet, Konrad Zdanowski. A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata. In Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris E. Nikoletseas, Wolfgang Thomas, editors, Automata, Languages and Programming, 36th Internatilonal Collogquium, ICALP 2009, Rhodes, greece, July 5-12, 2009, Proceedings, Part II. Volume 5556 of Lecture Notes in Computer Science, pages 151-162, Springer, 2009. [doi]

Abstract

Abstract is missing.