Simple restriction in context-free rewriting
From MaRDI portal
Publication:1959430
DOI10.1016/j.jcss.2010.04.001zbMath1209.68290OpenAlexW2172260861MaRDI QIDQ1959430
Publication date: 7 October 2010
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.2010.04.001
Related Items
On restricted context-free grammars, Computational completeness of simple semi-conditional insertion-deletion systems of degree (2,1), A Pumping Lemma for Permitting Semi-Conditional Languages, Improved descriptional complexity results on generalized forbidding grammars
Cites Work
- A variant of random context grammars: Semi-conditional grammars
- A shrinking lemma for random forbidding context languages
- Scattered 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
- Accepting grammars with regulation
- Some restrictive devices for context-free grammars
- A pumping lemma for random permitting context languages
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item