Corpus ID: 211252422

Extensions of $\omega$-Regular Languages.

@article{Bojanczyk2020ExtensionsO,
  title={Extensions of \$\omega\$-Regular Languages.},
  author={Mikolaj Bojanczyk and Edon Kelmendi and Rafal Stefanski and Georg Zetzsche},
  journal={arXiv: Formal Languages and Automata Theory},
  year={2020}
}
  • Mikolaj Bojanczyk, Edon Kelmendi, +1 author Georg Zetzsche
  • Published 2020
  • Mathematics, Computer Science
  • arXiv: Formal Languages and Automata Theory
  • We consider extensions of monadic second order logic over $\omega$-words, which are obtained by adding one language that is not $\omega$-regular. We show that if the added language $L$ has a neutral letter, then the resulting logic is necessarily undecidable. A corollary is that the $\omega$-regular languages are the only decidable Boolean-closed full trio over $\omega$-words. 

    Topics from this paper.

    References

    Publications referenced by this paper.