@inproceedings{10.1007/978-3-642-02930-1_13,
    Abstract = {In this paper we establish a lower bound hist(n) for the problem of translating a B{\"u}chi word automaton of size n into a deterministic Rabin word automaton when both the B{\"u}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 $\Omega$((1.64n)n) and in o((1.65n)n).},
    Address = {Berlin, Heidelberg},
    Author = {Colcombet, Thomas and Zdanowski, Konrad},
    BookTitle = {Automata, Languages and Programming},
    Editor = {Albers, Susanne and Marchetti-Spaccamela, Alberto and Matias, Yossi and Nikoletseas, Sotiris and Thomas, Wolfgang},
    File = {A Tight Lower Bound for Determinization of Transition Labeled Buchi Automata - Colcombet-Zdanowski2009\_Chapter\_ATightLowerBoundForDeterminiza - a - a - z.pdf},
    ISBN = {978-3-642-02930-1},
    Pages = {151--162},
    Publisher = {Springer Berlin Heidelberg},
    Title = {A Tight Lower Bound for Determinization of Transition Labeled B{\"u}chi Automata},
    Year = {2009},
    date-added = {2019-08-13 10:52:50 +0200},
    date-modified = {2019-08-13 10:52:50 +0200},
    doi = {10.1007/978-3-642-02930-1_13}
}

@inproceedings{10.1007/978-3-642-02930-1_13, Abstract = {In this paper we establish a lower bound hist(n) for the problem of translating a B{\"u}chi word automaton of size n into a deterministic Rabin word automaton when both the B{\"u}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 $\Omega$((1.64n)n) and in o((1.65n)n).}, Address = {Berlin, Heidelberg}, Author = {Colcombet, Thomas and Zdanowski, Konrad}, BookTitle = {Automata, Languages and Programming}, Editor = {Albers, Susanne and Marchetti-Spaccamela, Alberto and Matias, Yossi and Nikoletseas, Sotiris and Thomas, Wolfgang}, File = {A Tight Lower Bound for Determinization of Transition Labeled Buchi Automata - Colcombet-Zdanowski2009_Chapter_ATightLowerBoundForDeterminiza - a - a - z.pdf}, ISBN = {978-3-642-02930-1}, Pages = {151--162}, Publisher = {Springer Berlin Heidelberg}, Title = {A Tight Lower Bound for Determinization of Transition Labeled B{\"u}chi Automata}, Year = {2009}, date-added = {2019-08-13 10:52:50 +0200}, date-modified = {2019-08-13 10:52:50 +0200}, doi = {10.1007/978-3-642-02930-1_13} }