Pages that link to "Item:Q2113382"
From MaRDI portal
The following pages link to On the computational completeness of matrix simple semi-conditional grammars (Q2113382):
Displaying 5 items.
- Prescribed teams of rules working on several objects (Q2104130) (← links)
- A reformulation of matrix graph grammars with Boolean complexes (Q2380228) (← links)
- (Q3680296) (← links)
- Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars (Q5158664) (← links)
- Pareto grammars (Q6621946) (← links)