Ogden’s Lemma, Multiple Context-Free Grammars, and the Control Language Hierarchy

DOI10.1007/978-3-319-30000-9_29zbMath1443.68088OpenAlexW2395793686MaRDI QIDQ2798734

Makoto Kanazawa

Publication date: 13 April 2016

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-30000-9_29

zbMATH Keywords

multiple context-free grammarscontrol languagesOgden's lemma

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)