@InProceedings{duparc_et_al:LIPIcs.FSTTCS.2011.363,
author = {Duparc, Jacques and Facchini, Alessandro and Murlak, Filip},
title = {{Definable Operations On Weakly Recognizable Sets of Trees}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {363--374},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.363},
URN = {urn:nbn:de:0030-drops-33361},
doi = {10.4230/LIPIcs.FSTTCS.2011.363},
annote = {Keywords: alternating automata, Wadge hierarchy, index hierarchy}
}