Advertisement

Decidability of S1S and S2S

  • Mark Weyer
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2500)

Abstract

The purpose of this chapter is to prove the decidability of monadic second-order logic over infinite words and infinite binary trees, denoted S1S and S2S. It is organized as follows.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Mark Weyer
    • 1
  1. 1.Institut für Mathematische LogikUniversitä FreiburgGermany

Personalised recommendations