An Automata Characterisation for Multiple Context-Free Languages

DOI10.1007/978-3-662-53132-7_12zbMath1436.68168arXiv1606.02975OpenAlexW2409739580MaRDI QIDQ2817383

Tobias Denkinger

Publication date: 30 August 2016

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.02975

zbMATH Keywords

multiple context-free languagestree stack automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Tree-walking-storage automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Closure properties in the class of multiple context-free groups

Cites Work

• On multiple context-free grammars
• Some definitional suggestions for automata theory
• A Chomsky-Schützenberger Theorem for Weighted Automata with Storage
• Pushdown tree automata
• Nested Stack Automata
• On context-free languages and push-down automata

This page was built for publication: An Automata Characterisation for Multiple Context-Free Languages