Abstract
In 1969, Rabin [148] showed that the monadic second-order theory (MSO-theory) of infinite binary trees is decidable (see Chapter 12 of this volume or [183]). Ever since, it has been an interesting goal to extend this result to other classes of objects.
Cite
CITATION STYLE
APA
Leucker, M. (2002). Prefix-Recognizable Graphs and Monadic Logic (pp. 263–283). https://doi.org/10.1007/3-540-36387-4_15
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