An automata characterisation for multiple context-free languages
arXiv:1606.02975
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.
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)