The monadic second order theory of trees given by arbitrary level-two recursion schemes is decidable

Lecture Notes in Computer Science

Volumn 3461, Issue , 2005, Pages 39-54

  Aehlig, Klaus ^a   De Miranda, Jolie G ^a   Ong, C H Luke ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER SCIENCE; COMPUTER SIMULATION; MATHEMATICAL MODELS; PROBLEM SOLVING; THEOREM PROVING;

LEVEL-2 LAMBDA-TREE; MONADIC SECOND ORDER THEORY; RECURSION SCHEMES; TREE AUTOMATON;

TREES (MATHEMATICS);

EID: 24944481687     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11417170_5     Document Type: Conference Paper

References (13)

1. Klaus Aehlig, Jolie G de Miranda, and C H Luke Ong. Safety is not a restriction at level two for string languages. In Foundations of Software Science and Computation Structures (FOSSACS '05), April 2005. To appear.
2. A. Asperti, V. Danos, C. Laneve, and L. Regnier. Paths in the lambda-calculus. In Proceedings of the Ninth Annual IEEE Symposium an Logic in Computer Science (LICS '94), pages 426-436, July 1994.
3. D. Caucal. On infinite transition graphs having a decidable monadic theory. In F. M. auf der Heide and B. Monien, editors, Proceedings of the 23th International Colloquium on Automata, Languages and Programming (ICALP '96), volume 1099 of Lecture Notes in Computer Science, pages 194-205. Springer Verlag, 1996.
4. B. Courcelle. The monadic second-order logic of graphs IX: Machines and their behaviours. Theoretical Comput. Sci., 151(1):125-162, 1995.
5. J. R. Kennaway, J. W. Klop, and F. J. d. Vries. Infinitary lambda calculus. Theoretical Comput. Sci., 175(1):93-125, Mar. 1997.
6. T. Knapik, D. Niwiński, and P. Urzyczyn. Deciding monadic theories of hyperalgebraic trees. In S. Abramsky, editor, Proceedings of the 5th International Conference on Typed Lambda Caculi and Applications (TLCA '01), volume 2044 of Lecture Notes in Computer Science, pages 253-267. Springer Verlag, 2001.
7. T. Knapik, D. Niwiński, and P. Urzyczyn. Higher-order pushdown trees are easy. In M. Nielson, editor, Proceedings of the 5th International Conference Foundations of Software Science and Computation Structures (FOSSACS '02), volume 2303 of Lecture Notes in Computer Science, pages 205-222, Apr. 2002.
8. T. Knapik, D. Niwiński, P. Urzyczyn, and I. Walukiewicz. Unsafe grammars, panic automata, and decidability. Manuscript, Oct. 2004.
9. O. Kupferman and M. Y. Vardi. An automata-theoretic approach to reasoning about infinite-state systems. In E. A. Emerson and A. P. Sistla, editors, 12th International Conference on Computer Aided Verification (CAV '00), volume 1855 of Lecture Notes in Computer Science, pages 36-52. Springer Verlag, 2000.
10. D. E. Muller and P. E. Schupp. Alternating automata on infinite trees. Theoretical Comput. Sci., 54:267-276, 1987.
11. M. O. Rabin. Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society, 141:1-35, July 1969.
12. M. Y. Vardi. Reasoning about the past with two-way automata. In K. G. Larsen, S. Skyum, and G. Winskel, editors, Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP 98), volume 1443 of Lecture Notes in Computer Science, pages 628-641. Springer Verlag, 1998.
13. I. Walukiewicz. Pushdown processes: Games and model-checking. Information and Computation, 164(2):234-263, Jan. 2001.