Mikolaj Bojanczyk, Damian Niwinski, Alexander Rabinovich, Adam Radziwonczyk-Syta, Michal Skrzypczak. On the Borel Complexity of MSO Definable Sets of Branches. Fundamenta Informaticae, 98(4):337-349, 2010. [doi]
@article{BojanczykNRRS10,
title = {On the Borel Complexity of MSO Definable Sets of Branches},
author = {Mikolaj Bojanczyk and Damian Niwinski and Alexander Rabinovich and Adam Radziwonczyk-Syta and Michal Skrzypczak},
year = {2010},
doi = {10.3233/FI-2010-231},
url = {http://dx.doi.org/10.3233/FI-2010-231},
researchr = {https://researchr.org/publication/BojanczykNRRS10},
cites = {0},
citedby = {0},
journal = {Fundamenta Informaticae},
volume = {98},
number = {4},
pages = {337-349},
}