Pages that link to "Item:Q5248992"
From MaRDI portal
The following pages link to ON THE LEFTMOST DERVIATION IN MATRIX GRAMMARS (Q5248992):
Displaying 5 items.
- Nonterminal complexity of programmed grammars. (Q1401269) (← links)
- On some derivation mechanisms and the complexity of their Szilard languages (Q2453536) (← links)
- Solutions to four open problems concerning controlled pure grammar systems (Q2921920) (← links)
- One-Sided Random Context Grammars with Leftmost Derivations (Q3166950) (← links)
- On the computational completeness of generalized forbidding matrix grammars (Q6496878) (← links)