Skip to main content
Conference ProceedingsOPEN ACCESS

Higher-order pushdown trees are easy

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2303 205-222
DOI: 10.1007/3-540-45931-6_15
152Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Knapik, T., Niwiński, D., & Urzyczyn, P. (2002). Higher-order pushdown trees are easy. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2303, pp. 205–222). Springer Verlag. https://doi.org/10.1007/3-540-45931-6_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free