The following pages link to (Q4318906):
Displaying 10 items.
- Language classes generated by tree controlled grammars with bounded nonterminal complexity (Q443749) (← links)
- Nonterminal complexity of tree controlled grammars (Q719323) (← links)
- A note on the descriptional complexity of semi-conditional grammars (Q990095) (← links)
- On the descriptional complexity of some rewriting mechanisms regulated by context conditions (Q1763724) (← links)
- Simple restriction in context-free rewriting (Q1959430) (← links)
- On the computational completeness of matrix simple semi-conditional grammars (Q2113382) (← links)
- A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions (Q3618613) (← links)
- On context-free rewriting with a simple restriction and its computational completeness (Q3625698) (← links)
- Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars (Q5158664) (← links)
- Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity (Q5200099) (← links)
