On the Borel Complexity of MSO Definable Sets of Branches

DOI10.3233/FI-2010-231zbMath1206.03041OpenAlexW1682293995MaRDI QIDQ3561217

Adam Radziwończyk-Syta, Michał Skrzypczak, Alexander Rabinovich, Mikołaj Bojańczyk, Damian Niwinski

Publication date: 25 May 2010

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2010-231

zbMATH Keywords

automatamonadic second-order logictreesBorel hierarchyinfinite words

Mathematics Subject Classification ID

Descriptive set theory (03E15) Automata and formal grammars in connection with logical questions (03D05)

Related Items (2)

Topological extension of parity automata ⋮ Regular sets over extended tree structures

This page was built for publication: On the Borel Complexity of MSO Definable Sets of Branches