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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Weyer, M. (2002). Decidability of S1S and S2S. In: Grädel, E., Thomas, W., Wilke, T. (eds) Automata Logics, and Infinite Games. Lecture Notes in Computer Science, vol 2500. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36387-4_12
Download citation
DOI: https://doi.org/10.1007/3-540-36387-4_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00388-5
Online ISBN: 978-3-540-36387-3
eBook Packages: Springer Book Archive