Monadic second-order logic on tree-like structures

Theoretical Computer Science

Volumn 275, Issue 1-2, 2002, Pages 311-346

  Walukiewicz, Igor ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

Decidability; Monadic second order logic; Tree automata

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; MATHEMATICAL OPERATORS; TREES (MATHEMATICS);

TREE AUTOMATA;

COMPUTER SCIENCE;

EID: 0037187424     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00185-2     Document Type: Article

References (23)

1. Decision methods in the theory of ordinals
2. δσ
3. Monadic second-order graph transductions: A survey
4. Monadic second-order logic, graphs and unfoldings of transition systems
5. Uniform interpolation, automata and the modal mu-calculus
6. Decidability and undecidability of extensions of second (first) order theory of (generalized) successor
7. Tree automata, mu-calculus and determinacy
8. Automata for the μ-calculus and related results
9. On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
10. Progress measures, immediate determinacy and a subset construction for tree automata
11. Infinite games played on finite graphs
12. Decidability of second-order theories and automata on infinite trees
13. Decidable theories
14. Decidability of monadic theories
15. The monadic second order theory of order
16. An automata theoretic procedure for the propositional mu-calculus
17. Languages, automata, and logic
18. Infinite games on finitely coloured graphs with applications to automata on infinite trees