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

  title={A Tight Lower Bound for Determinization of Transition Labeled B{\"u}chi Automata},
  author={Thomas Colcombet and Konrad Zdanowski},
In this paper we establish a lower bound hist(n) for the problem of translating a Büchi word automaton of size n into a deterministic Rabin word automaton when both the Büchi and the Rabin condition label transitions rather than states. This lower bound exactly matches the known upper bound to this problem. The function hist(n) is in Ω((1.64n)) and in o((1.65n)). Our result entails a lower bound of hist(n − 1) when the input Büchi automaton has its Büchi acceptance condition labeling states (as… CONTINUE READING

From This Paper

Topics from this paper.


Publications referenced by this paper.
Showing 1-10 of 16 references

Lower bounds for complementation of ω-automata via the full automata technique

Qi Qi Yan
Logical Methods in Computer Science, • 2008
View 2 Excerpts

Rabin and D . Scott . Finite automata and their decision problems . Technical report , 1964 . [ Saf 88 ] S . Safra . On the complexity of ω - automata

O. Michael
Logical Methods in Computer Science • 2007

Optimal Bounds for Transformations of !-automata

Christof Ll Oding
View 1 Excerpt

Languages, Automata, and Logic

Handbook of Formal Languages • 1997

Similar Papers

Loading similar papers…