@inproceedings{bojanczyk_et_al:LIPIcs:2012:3427,
Address = {Dagstuhl, Germany},
Annote = {Keywords: Infinite trees, distance automata, MSO+U, profinite words},
Author = {Bojanczyk, Mikolaj and Torunczyk, Szymon},
BookTitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)},
Editor = {D{\"u}rr, Christoph and Wilke, Thomas},
File = {Weak MSO+U over infinite trees - Bojanczyk, Torunczyk (0) (0) - a - a - o.pdf},
ISBN = {978-3-939897-35-4},
ISSN = {1868-8969},
Keywords = {MSO+U},
Pages = {648--660},
Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
Title = {{Weak MSO+U over infinite trees}},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3427},
Volume = {14},
Year = {2012},
bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2012/3427},
bdsk-url-2 = {http://dx.doi.org/10.4230/LIPIcs.STACS.2012.648},
date-added = {2012-04-05 15:20:01 +0200},
date-modified = {2012-04-05 13:20:37 +0000},
file-2 = {Weak MSO+U over infinite trees - wmsou-trees - o.pdf},
urn = {urn:nbn:de:0030-drops-34279},
doi = {10.4230/LIPIcs.STACS.2012.648}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A