@inproceedings{10.1145/3373718.3394757,
    Address = {New York, NY, USA},
    Author = {Tian, Cong and Wang, Wensheng and Duan, Zhenhua},
    BookTitle = {Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science},
    File = {Making Streett Determinization Tight - 2006.16476 - a - d.pdf},
    ISBN = {9781450371049},
    Keywords = {state complexity, lower bound, determinization, Streett automata, Rabin automata},
    Location = {Saarbr\"{u}cken, Germany},
    Pages = {859--872},
    Publisher = {Association for Computing Machinery},
    Series = {LICS '20},
    Title = {Making Streett Determinization Tight},
    URL = {https://doi.org/10.1145/3373718.3394757},
    Year = {2020},
    bdsk-url-1 = {https://doi.org/10.1145/3373718.3394757},
    date-added = {2020-07-04 10:00:48 +0200},
    date-modified = {2020-07-04 10:00:48 +0200},
    numpages = {14},
    doi = {10.1145/3373718.3394757}
}

@inproceedings{10.1145/3373718.3394757, Address = {New York, NY, USA}, Author = {Tian, Cong and Wang, Wensheng and Duan, Zhenhua}, BookTitle = {Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science}, File = {Making Streett Determinization Tight - 2006.16476 - a - d.pdf}, ISBN = {9781450371049}, Keywords = {state complexity, lower bound, determinization, Streett automata, Rabin automata}, Location = {Saarbr\"{u}cken, Germany}, Pages = {859--872}, Publisher = {Association for Computing Machinery}, Series = {LICS '20}, Title = {Making Streett Determinization Tight}, URL = {https://doi.org/10.1145/3373718.3394757}, Year = {2020}, bdsk-url-1 = {https://doi.org/10.1145/3373718.3394757}, date-added = {2020-07-04 10:00:48 +0200}, date-modified = {2020-07-04 10:00:48 +0200}, numpages = {14}, doi = {10.1145/3373718.3394757} }