The Pumping Lemma for Well-Nested Multiple Context-Free Languages
From MaRDI portal
Publication:3637235
DOI10.1007/978-3-642-02737-6_25zbMath1247.68145OpenAlexW1499005716MaRDI QIDQ3637235
Publication date: 7 July 2009
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02737-6_25
Related Items
Ogden Property for Linear Displacement Context-Free Grammars ⋮ Comparing consecutive letter counts in multiple context-free languages ⋮ Disentangling Notions of Specifier Impenetrability: Late Adjunction, Islands, and Expressive Power ⋮ Normal Forms for Multiple Context-Free Languages and Displacement Lambek Grammars ⋮ The Cooper storage idiom ⋮ Multiple context-free tree grammars: lexicalization and characterization ⋮ Extended Lambek Calculi and First-Order Linear Logic ⋮ The failure of the strong pumping lemma for multiple context-free languages ⋮ Ogden's lemma, multiple context-free grammars, and the control language hierarchy ⋮ On the Mild Context-Sensitivity of k-Tree Wrapping Grammar ⋮ MIX is a 2-MCFL and the word problem in \(\mathbb{Z}^2\) is captured by the IO and the OI hierarchies
Cites Work
- Unnamed Item
- Unnamed Item
- The string generating power of context-free hypergraph grammars
- On multiple context-free grammars
- On parsing coupled-context-free languages
- Independent parallelism in finite copying parallel rewriting systems
- Closure properties of linear context-free tree languages with an application to optimality theory
- Theory of Formal Systems. (AM-47)
- Pumping lemmas for the control language hierarchy
This page was built for publication: The Pumping Lemma for Well-Nested Multiple Context-Free Languages
