@article{NiwinskiWalukiewicz:ENTCS:2005,
    Abstract = {We show an algorithm which, for a given deterministic parity automaton on infinite trees, computes the minimal Mostowski (or Rabin) index of a nondeterministic automaton recognizing the same language. This extends a previous result of Urba{\'n}ski on deciding if a given deterministic Rabin automaton is equivalent to a nondeterministic B{\"u}chi automaton. The algorithm runs in the time of verifying the non-emptiness of nondeterministic parity automata.},
    Author = {Niwi{\'n}ski, Damian and Walukiewicz, Igor},
    File = {Deciding Nondeterministic Hierarchy of Deterministic Tree Automata - 1-s2.0-S1571066105000551-main - a - c.pdf},
    ISSN = {1571-0661},
    Journal = {Electronic Notes in Theoretical Computer Science},
    Keywords = {Parity tree automata, Mostowski index, decidability},
    Note = {Proceedings of the 11th Workshop on Logic, Language, Information and Computation (WoLLIC 2004)},
    Pages = {195--208},
    Title = {Deciding Nondeterministic Hierarchy of Deterministic Tree Automata},
    URL = {http://www.sciencedirect.com/science/article/pii/S1571066105000551},
    Volume = {123},
    Year = {2005},
    bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S1571066105000551},
    bdsk-url-2 = {https://doi.org/10.1016/j.entcs.2004.05.015},
    date-added = {2020-08-11 13:26:05 +0200},
    date-modified = {2020-08-11 13:26:22 +0200},
    doi = {10.1016/j.entcs.2004.05.015}
}

@article{NiwinskiWalukiewicz:ENTCS:2005, Abstract = {We show an algorithm which, for a given deterministic parity automaton on infinite trees, computes the minimal Mostowski (or Rabin) index of a nondeterministic automaton recognizing the same language. This extends a previous result of Urba{\'n}ski on deciding if a given deterministic Rabin automaton is equivalent to a nondeterministic B{\"u}chi automaton. The algorithm runs in the time of verifying the non-emptiness of nondeterministic parity automata.}, Author = {Niwi{\'n}ski, Damian and Walukiewicz, Igor}, File = {Deciding Nondeterministic Hierarchy of Deterministic Tree Automata - 1-s2.0-S1571066105000551-main - a - c.pdf}, ISSN = {1571-0661}, Journal = {Electronic Notes in Theoretical Computer Science}, Keywords = {Parity tree automata, Mostowski index, decidability}, Note = {Proceedings of the 11th Workshop on Logic, Language, Information and Computation (WoLLIC 2004)}, Pages = {195--208}, Title = {Deciding Nondeterministic Hierarchy of Deterministic Tree Automata}, URL = {http://www.sciencedirect.com/science/article/pii/S1571066105000551}, Volume = {123}, Year = {2005}, bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S1571066105000551}, bdsk-url-2 = {https://doi.org/10.1016/j.entcs.2004.05.015}, date-added = {2020-08-11 13:26:05 +0200}, date-modified = {2020-08-11 13:26:22 +0200}, doi = {10.1016/j.entcs.2004.05.015} }