@article{Muller_1995,
    doi = {10.1016/0304-3975(94)00214-4},
    url = {https://doi.org/10.1016%2F0304-3975%2894%2900214-4},
    year = {1995},
    month = {apr},
    publisher = {Elsevier {BV}},
    volume = {141},
    number = {1-2},
    pages = {69--107},
    author = {David E. Muller and Paul E. Schupp},
    title = {Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, {McNaughton} and Safra},
    journal = {Theoretical Computer Science}
}

@article{Muller_1995, doi = {10.1016/0304-3975(94)00214-4}, url = {https://doi.org/10.1016%2F0304-3975%2894%2900214-4}, year = {1995}, month = {apr}, publisher = {Elsevier {BV}}, volume = {141}, number = {1-2}, pages = {69--107}, author = {David E. Muller and Paul E. Schupp}, title = {Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, {McNaughton} and Safra}, journal = {Theoretical Computer Science} }