@InProceedings{rabinovich_et_al:LIPIcs.CSL.2021.36,
author = {Rabinovich, Alexander and Tiferet, Doron},
title = {{Degrees of Ambiguity for Parity Tree Automata}},
booktitle = {29th EACSL Annual Conference on Computer Science Logic (CSL 2021)},
pages = {36:1--36:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-175-7},
ISSN = {1868-8969},
year = {2021},
volume = {183},
editor = {Baier, Christel and Goubault-Larrecq, Jean},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2021.36},
URN = {urn:nbn:de:0030-drops-134709},
doi = {10.4230/LIPIcs.CSL.2021.36},
annote = {Keywords: automata on infinite trees, degree of ambiguity, omega word automata, parity automata}
}