Abstract
We show that the monadicsec ond-order theory of an infinite tree recognized by a higher-order pushdown automaton of any level is decidable. We also show that trees recognized by pushdown automata of level n coincide with trees generated by safe higher-order grammars of level n. Our decidability result extends the result of Courcelle on algebraic(pushdo wn of level 1) trees and our own result on trees of level 2.
Partly supported by KBN Grant 7 T11C 027 20.
Partly supported by KBN Grant 7 T11C 028 20.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
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.
B. Courcelle. The monadic second-order theory of graphs IX: Machines and their behaviours. Theoretical Comput. Sci., 151:125–162, 1995.
B. Courcelle and T. Knapik. The evaluation of first-order substitution is monadic second-order compatible. Theoretical Comput. Sci., 2002. To appear.
W. Damm. The IO-and OI-hierarchies. Theoretical Comput. Sci., 20(2):95–208, 1982.
W. Damm and A. Goerdt. An automata-theoreticc haracterization of the OIhierarchy. Information and Control, 71:1–32, 1986.
J. Engelfriet. Iterated push-down automata and complexity classes. In Proc. 15th STOC, pages 365–373, 1983.
H. Hungar. Model checking and higher-order recursion. In L. Pacholski, M. Kutyłowski and T. Wierzbicki, editors, Mathematical Foundations of Computer Science 1999, LNCS 1672, pages 149–159, 1999.
B. Jacobs and J. Rutten. A tutorial on (co)algebras and (co)induction. Bulletin of EATCS, 1997(62):222–259.
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.
A. Kfoury and P. Urzyczyn. Finitely typed functional programs, part II: comparisons to imperative languages. Report, Boston University, 1988.
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.
W. Kowalczyk, D. Niwiński, and J. Tiuryn. A generalization of of Cook’s auxiliarypushdown-automata theorem. Fundamenta Informaticae, 12:497–506, 1989.
O. Kupferman and M. Vardi. An automata-theoreticapproach to reasoning about infinite-state systems. In Computer Aided Verification, Proc. 12th Int. Conference, Lecture Notes in Computer Science. Springer-Verlag, 2000.
D. Muller and P. Schupp. The theory of ends, pushdown automata, and secondorder logic. Theoretical Comput. Sci., 37:51–75, 1985.
M. O. Rabin. Decidability of second-order theories and automata on infinite trees. Trans. Amer. Soc, 141:1–35, 1969.
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.
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.
I. Walukiewicz. Pushdown processes: Games and model checking. Information and Computation, 164(2):234–263, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Knapik, T., Niwiński, D., Urzyczyn, P. (2002). Higher-Order Pushdown Trees Are Easy. In: Nielsen, M., Engberg, U. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2002. Lecture Notes in Computer Science, vol 2303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45931-6_15
Download citation
DOI: https://doi.org/10.1007/3-540-45931-6_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43366-8
Online ISBN: 978-3-540-45931-6
eBook Packages: Springer Book Archive