Pages that link to "Item:Q1763724"
From MaRDI portal
The following pages link to On the descriptional complexity of some rewriting mechanisms regulated by context conditions (Q1763724):
Displayed 13 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 scattered context grammars (Q1001907) (← links)
- Scattered context grammars that erase nonterminals in a generalized \(k\)-limited way (Q1006344) (← links)
- On the computational completeness of matrix simple semi-conditional grammars (Q2113382) (← links)
- Descriptional complexity of semi-conditional grammars (Q2379990) (← links)
- Nonterminal complexity of one-sided random context grammars (Q2428495) (← links)
- Canonical scattered context generators of sentences with their parses (Q2465627) (← links)
- A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions (Q3618613) (← 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)
- Improved descriptional complexity results on generalized forbidding grammars (Q5918761) (← links)