Pages that link to "Item:Q1670738"
From MaRDI portal
The following pages link to New nonterminal complexity results for semi-conditional grammars (Q1670738):
Displaying 9 items.
- Nonterminal complexity of tree controlled grammars (Q719323) (← links)
- Parsimonious computational completeness (Q832917) (← links)
- A variant of random context grammars: Semi-conditional grammars (Q1072714) (← links)
- Minimizing rules and nonterminals in semi-conditional grammars: non-trivial for the simple case (Q1647317) (← links)
- On the descriptional complexity of some rewriting mechanisms regulated by context conditions (Q1763724) (← links)
- On the computational completeness of matrix simple semi-conditional grammars (Q2113382) (← links)
- Descriptional complexity of semi-conditional grammars (Q2379990) (← links)
- Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars (Q5158664) (← links)
- Improved descriptional complexity results on generalized forbidding grammars (Q5918761) (← links)