The copying power of well-nested multiple context-free grammars

DOI10.1007/978-3-642-13089-2_29zbMATH Open1284.68326OpenAlexW1821731992MaRDI QIDQ3564876FDOQ3564876

Authors: Makoto Kanazawa, S. Salvati 

Publication date: 26 May 2010

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-642-13089-2_29

Recommendations

• The Pumping Lemma for Well-Nested Multiple Context-Free Languages
• On multiple context-free grammars
• Context-free grammars with linked nonterminals
• Ogden's lemma, multiple context-free grammars, and the control language hierarchy
• Ogden's lemma, multiple context-free grammars, and the control language hierarchy

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cited In (10)

• Title not available (Why is that?)
• Multiple context-free tree grammars: lexicalization and characterization
• Ogden's lemma, multiple context-free grammars, and the control language hierarchy
• The failure of the strong pumping lemma for multiple context-free languages
• MIX is a 2-MCFL and the word problem in \(\mathbb{Z}^2\) is captured by the IO and the OI hierarchies
• Normal forms for multiple context-free languages and displacement Lambek grammars
• Ogden property for linear displacement context-free grammars
• Ogden's lemma, multiple context-free grammars, and the control language hierarchy
• The Pumping Lemma for Well-Nested Multiple Context-Free Languages
• On regularity of languages generated by copying systems

This page was built for publication: The copying power of well-nested multiple context-free grammars

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