2000 character limit reached
An automata characterisation for multiple context-free languages (1606.02975v3)
Published 9 Jun 2016 in cs.FL
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.