@InProceedings{bojanczyk_et_al:LIPIcs.STACS.2012.648,
author = {Bojanczyk, Mikolaj and Torunczyk, Szymon},
title = {{Weak MSO+U over infinite trees}},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)},
pages = {648--660},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-35-4},
ISSN = {1868-8969},
year = {2012},
volume = {14},
editor = {D\"{u}rr, Christoph and Wilke, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2012.648},
URN = {urn:nbn:de:0030-drops-34279},
doi = {10.4230/LIPIcs.STACS.2012.648},
annote = {Keywords: Infinite trees, distance automata, MSO+U, profinite words}
}