Mikolaj Bojanczyk, Szymon Torunczyk. Weak MSO+U over infinite trees. In Christoph Dürr, Thomas Wilke, editors, 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France. Volume 14 of LIPIcs, pages 648-660, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2012. [doi]
@inproceedings{BojanczykT12-0,
title = {Weak MSO+U over infinite trees},
author = {Mikolaj Bojanczyk and Szymon Torunczyk},
year = {2012},
doi = {10.4230/LIPIcs.STACS.2012.648},
url = {http://dx.doi.org/10.4230/LIPIcs.STACS.2012.648},
researchr = {https://researchr.org/publication/BojanczykT12-0},
cites = {0},
citedby = {0},
pages = {648-660},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France},
editor = {Christoph Dürr and Thomas Wilke},
volume = {14},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-939897-35-4},
}