Decidability of MSO theories of tree structures
From MaRDI portal
Recommendations
Cited in
(7)- Deciding monadic theories of hyperalgebraic trees
- Determinacy and Rewriting of Top-Down and MSO Tree Transformations
- Transforming structures by set interpretations
- The monadic second order theory of trees given by arbitrary level-two recursion schemes is decidable
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Regular sets over extended tree structures
- The equivalence problem for deterministic MSO tree transducers is decidable
This page was built for publication: Decidability of MSO theories of tree structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5465875)