Decidability of S1S and S2S
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2500)
- 2.2k Downloads
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.
Unable to display preview. Download preview PDF.
© Springer-Verlag Berlin Heidelberg 2002