Pages that link to "Item:Q5204313"
From MaRDI portal
The following pages link to A Greibach normal form for context-free graph grammars (Q5204313):
Displaying 6 items.
- Juggrnaut: using graph grammars for abstracting unbounded heap structures (Q746781) (← links)
- An elementary proof of double Greibach normal form (Q1209361) (← links)
- Hypergraph languages of bounded degree (Q1318469) (← links)
- Abstracting Complex Data Structures by Hyperedge Replacement (Q3540389) (← links)
- (Q5021223) (← links)
- Hypergraph Basic Categorial Grammars (Q5100731) (← links)
