An Automata Characterisation for Multiple Context-Free Languages

From MaRDI portal



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 page was built for publication: An Automata Characterisation for Multiple Context-Free Languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817383)