Abstract
The fundamental results of Büchi [Büc62] and Rabin [Rab69] state that the monadic second-order (mso) theory of the ω-chain (ω,≤) and of the complete binary tree ({0, 1}*,≼,≤lex) is decidable.
Cite
CITATION STYLE
APA
Hutchison, D., Kanad, T., Kittler, J., Kleinberg, J. M., Mattern, F., Mitchell, J. C., … Skrzypczak, M. (2016). Introduction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9802 LNCS, pp. 29–36). Springer Verlag. https://doi.org/10.1007/978-3-662-52947-8_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free