Skip to main content
Conference Proceedings

An automata characterisation for multiple context-free languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2016) 9840 138-150
DOI: 10.1007/978-3-662-53132-7_12
6Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We introduce tree stack automata as a new class of automata with storage and identify a restricted form of tree stack automata that recognises exactly the multiple context-free languages.

Cite

CITATION STYLE

APA

Denkinger, T. (2016). An automata characterisation for multiple context-free languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9840, pp. 138–150). Springer Verlag. https://doi.org/10.1007/978-3-662-53132-7_12

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