@inproceedings{https___doi.org_10.4230_lipics.icalp.2025.164,
    doi = {10.4230/lipics.icalp.2025.164},
    url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.164},
    author = {Lehtinen, Karoliina and Lhote, Nathan},
    keywords = {Parity tree automata, alternating automata, Cantor-Bendixson rank, Theory of computation → Formal languages and automata theory},
    language = {en},
    title = {A Collapse of the Parity Index Hierarchy of Tree Automata, Based on Cantor-Bendixson Ranks},
    publisher = {Schloss Dagstuhl – Leibniz-Zentrum für Informatik},
    year = {2025},
    copyright = {Creative Commons Attribution 4.0 International license},
    date-added = {2025-7-5 6:33:16 +0100}
}

@inproceedings{https___doi.org_10.4230_lipics.icalp.2025.164, doi = {10.4230/lipics.icalp.2025.164}, url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.164}, author = {Lehtinen, Karoliina and Lhote, Nathan}, keywords = {Parity tree automata, alternating automata, Cantor-Bendixson rank, Theory of computation → Formal languages and automata theory}, language = {en}, title = {A Collapse of the Parity Index Hierarchy of Tree Automata, Based on Cantor-Bendixson Ranks}, publisher = {Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, year = {2025}, copyright = {Creative Commons Attribution 4.0 International license}, date-added = {2025-7-5 6:33:16 +0100} }