Higher-order pushdown trees are easy

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2303, Issue , 2002, Pages 205-222

  Knapik, Teodor ^a   Niwiński, Damian ^b   Urzyczyn, Paweł ^b  

^a UNIVERSITÉ DE LA RÉUNION   (France)

^b UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY;

HIGHER-ORDER; INFINITE TREES; LEVEL 2; LEVEL-1; ORDER THEORY; PUSH-DOWN AUTOMATA; PUSHDOWN;

FORESTRY;

EID: 84948946239     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45931-6_15     Document Type: Conference Paper

References (18)

1. D. Caucal. On infinite transition graphs having a decidable monadic second–order theory. In F. Meyer auf der Heide and B. Monien, editors, 23th International Colloquium on Automata Languages and Programming, LNCS 1099, pages 194–205, 1996. A long version will appear in TCS.
2. B. Courcelle. The monadic second–order theory of graphs IX: Machines and their behaviours. Theoretical Comput. Sci., 151:125–162, 1995.
3. B. Courcelle and T. Knapik. The evaluation of first-order substitution is monadic second–order compatible. Theoretical Comput. Sci., 2002. To appear.
4. W. Damm. The IO– and OI–hierarchies. Theoretical Comput. Sci., 20(2):95–208, 1982.
5. W. Damm and A. Goerdt. An automata-theoreticc haracterization of the OIhierarchy. Information and Control, 71:1–32, 1986.
6. J. Engelfriet. Iterated push-down automata and complexity classes. In Proc. 15th STOC, pages 365–373, 1983.
7. H. Hungar. Model checking and higher-order recursion. In L. Pacholski, M. Kuty8lowski and T. Wierzbicki, editors, Mathematical Foundations of Computer Science 1999, LNCS 1672, pages 149–159, 1999.
8. B. Jacobs and J. Rutten. A tutorial on (co)algebras and (co)induction. Bulletin of EATCS, 1997(62):222–259.
9. A.J. Kfoury, J. Tiuryn and P. Urzyczyn. On the expressive power of finitely typed and universally polymorphic recursive procedures. Theoretical Comput. Sci., 93:1–41, 1992.
10. A. Kfoury and P. Urzyczyn. Finitely typed functional programs, part II: comparisons to imperative languages. Report, Boston University, 1988.
11. T. Knapik, D. Niwiński, and P. Urzyczyn. Deciding monadic theories of hyperalgebraictrees. In Typed Lambda Calculi and Applications, 5th International Conference, LNCS 2044, pages 253–267. Springer-Verlag, 2001.
12. W. Kowalczyk, D. Niwiński, and J. Tiuryn. A generalization of of Cook’s auxiliarypushdown- automata theorem. Fundamenta Informaticae, 12:497–506, 1989.
13. O. Kupferman and M. Vardi. An automata-theoreticapproac h to reasoning about infinite-state systems. In Computer Aided Verification, Proc. 12th Int. Conference, Lecture Notes in Computer Science. Springer-Verlag, 2000.
14. D. Muller and P. Schupp. The theory of ends, pushdown automata, and secondorder logic. Theoretical Comput. Sci., 37:51–75, 1985.
15. M. O. Rabin. Decidability of second-order theories and automata on infinite trees. Trans. Amer. Soc, 141:1–35, 1969.
16. W. Thomas. Languages, automata, and logic. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3, pages 389–455. Springer-Verlag, 1997.
17. J. Tiuryn. Higher-order arrays and stacks in programming: An application of complexity theory to logics of programs. In Proc. 12th MFCS, LNCS 233, pages 177–198. Springer-Verlag, 1986.
18. I. Walukiewicz. Pushdown processes: Games and model checking. Information and Computation, 164(2):234–263, 2001.