On restricted context-free grammars
From MaRDI portal
Publication:414885
DOI10.1016/j.jcss.2011.05.008zbMath1247.68117MaRDI QIDQ414885
Tomáš Masopust, Juergen Dassow
Publication date: 11 May 2012
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2011.05.008
Related Items
A Pumping Lemma for Permitting Semi-Conditional Languages, Computational completeness of simple semi-conditional insertion-deletion systems of degree (2,1)
Cites Work
- Unnamed Item
- Unnamed Item
- A variant of random context grammars: Semi-conditional grammars
- A shrinking lemma for random forbidding context languages
- Simple restriction in context-free rewriting
- On Erasing Productions in Random Context Grammars
- A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions
- On context-free rewriting with a simple restriction and its computational completeness
- One-sided and two-sided context in formal grammars
- Some restrictive devices for context-free grammars
- Grammars with Context Conditions and Their Applications
- A pumping lemma for random permitting context languages