Pages that link to "Item:Q990095"
From MaRDI portal
The following pages link to A note on the descriptional complexity of semi-conditional grammars (Q990095):
Displayed 4 items.
- On the computational completeness of matrix simple semi-conditional grammars (Q2113382) (← links)
- Nonterminal complexity of one-sided random context grammars (Q2428495) (← links)
- Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars (Q5158664) (← links)
- Improved descriptional complexity results on generalized forbidding grammars (Q5918761) (← links)