Mikolaj Bojanczyk. Weak MSO+U with Path Quantifiers over Infinite Trees. In Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias, editors, Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II. Volume 8573 of Lecture Notes in Computer Science, pages 38-49, Springer, 2014. [doi]
@inproceedings{Bojanczyk14a,
title = {Weak MSO+U with Path Quantifiers over Infinite Trees},
author = {Mikolaj Bojanczyk},
year = {2014},
doi = {10.1007/978-3-662-43951-7_4},
url = {http://dx.doi.org/10.1007/978-3-662-43951-7_4},
researchr = {https://researchr.org/publication/Bojanczyk14a},
cites = {0},
citedby = {0},
pages = {38-49},
booktitle = {Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II},
editor = {Javier Esparza and Pierre Fraigniaud and Thore Husfeldt and Elias Koutsoupias},
volume = {8573},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-662-43950-0},
}