An automata characterisation for multiple context-free languages
Formal Languages and Automata Theory
2016-09-26 v3
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.
Keywords
Cite
@article{arxiv.1606.02975,
title = {An automata characterisation for multiple context-free languages},
author = {Tobias Denkinger},
journal= {arXiv preprint arXiv:1606.02975},
year = {2016}
}
Comments
This is an extended version of a paper with the same title accepted at the 20th International Conference on Developments in Language Theory (DLT 2016)