Descriptional complexity of semi-conditional grammars
From MaRDI portal
Publication:2379990
DOI10.1016/J.IPL.2007.05.002zbMATH Open1184.68299OpenAlexW2027134262MaRDI QIDQ2379990FDOQ2379990
Authors: Tomáš Masopust, Alexander Meduna 
Publication date: 24 March 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2007.05.002
Recommendations
- New nonterminal complexity results for semi-conditional grammars
- Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars
- scientific article; zbMATH DE number 1870506
- Minimizing rules and nonterminals in semi-conditional grammars: non-trivial for the simple case
- Descriptional complexity of multi-parallel grammars
Cites Work
- Title not available (Why is that?)
- A variant of random context grammars: Semi-conditional grammars
- Grammars with Context Conditions and Their Applications
- On the descriptional complexity of some rewriting mechanisms regulated by context conditions
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (18)
- Simple-semi-conditional versions of matrix grammars with a reduced regulating mechanism
- Title not available (Why is that?)
- Improved descriptional complexity results on generalized forbidding grammars
- Title not available (Why is that?)
- A note on the descriptional complexity of semi-conditional grammars
- Title not available (Why is that?)
- Generalized forbidding matrix grammars and their membrane computing perspective
- Descriptional complexity of matrix simple semi-conditional grammars
- Minimizing rules and nonterminals in semi-conditional grammars: non-trivial for the simple case
- Title not available (Why is that?)
- Descriptional complexity of multi-parallel grammars
- New nonterminal complexity results for semi-conditional grammars
- Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars
- On the descriptional complexity of some rewriting mechanisms regulated by context conditions
- CONDITIONAL GRAMMARS WITH RESTRICTIONS BY SYNTACTIC PARAMETERS
- Descriptional complexity of context-free grammar forms
- A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions
- Descriptional Complexity Of Generalized Forbidding Grammars
This page was built for publication: Descriptional complexity of semi-conditional grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379990)
