Skip to main content
Conference Proceedings

Hierarchies of infinite structures generated by pushdown automata and recursion schemes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2007) 4708 LNCS 15-21
DOI: 10.1007/978-3-540-74456-6_4
5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Higher-order recursion schemes and higher-order pushdown automata are closely related methods for generating infinite hierarchies of infinite structures. Subsuming well-known classes of models of computation, these rich hierarchies (of word languages, trees, and graphs respectively) have excellent model-checking properties. In this extended abstract, we survey recent expressivity and decidability results about these infinite structures. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Ong, C. H. L. (2007). Hierarchies of infinite structures generated by pushdown automata and recursion schemes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4708 LNCS, pp. 15–21). Springer Verlag. https://doi.org/10.1007/978-3-540-74456-6_4

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