An automata characterisation for multiple context-free languages
  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. 
Tobias Denkinger
cs.FL