scientific article; zbMATH DE number 709441
From MaRDI portal
Publication:4318906
Cited in
(12)- On the descriptional complexity of some rewriting mechanisms regulated by context conditions
- Simple restriction in context-free rewriting
- On the computational completeness of matrix simple semi-conditional 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
- Language classes generated by tree controlled grammars with bounded nonterminal complexity
- Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars
- Language classes generated by tree controlled grammars with bounded nonterminal complexity
- Non-simple rule counting in semi-conditional grammars
- Counting simple rules in semi-conditional grammars is not simple
- Nonterminal complexity of tree controlled grammars
- A note on the descriptional complexity of semi-conditional grammars
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4318906)
