On the Borel complexity of MSO definable sets of branches

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

Research output: Contribution to journalArticlepeer-review

Abstract

An infinite binaryword can be identified with a branch in the full binary tree. We consider sets of branches definable in monadic second-order logic over the tree, where we allow some extra monadic predicates on the nodes. We show that this class equals to the Boolean combinations of sets in the Borel class Σ02 over the Cantor discontinuum. Note that the last coincides with the Borel complexity of ω-regular languages.

Original languageEnglish
Pages (from-to)337-349
Number of pages13
JournalFundamenta Informaticae
Volume98
Issue number4
DOIs
StatePublished - 2010

Keywords

  • Automata
  • Borel hierarchy
  • Infinite words
  • Monadic 2nd-order logic
  • Trees

Fingerprint

Dive into the research topics of 'On the Borel complexity of MSO definable sets of branches'. Together they form a unique fingerprint.

Cite this