Pages that link to "Item:Q5055770"
From MaRDI portal
The following pages link to The equivalence of boundary and confluent graph grammars on graph languages of bounded degree (Q5055770):
Displaying 8 items.
- Boundary graph grammars with dynamic edge relabeling (Q909478) (← links)
- A comparison of boundary graph grammars and context-free hypergraph grammars (Q918718) (← links)
- Hypergraph languages of bounded degree (Q1318469) (← links)
- Monadic second-order definable graph transductions: a survey (Q1325847) (← links)
- The bounded degree problem for eNCE graph grammars (Q1363781) (← links)
- The bounded degree problem for non-obstructing eNCE graph grammars (Q4645278) (← links)
- Drawing graphs with attribute graph grammars (Q4645294) (← links)
- A Greibach normal form for context-free graph grammars (Q5204313) (← links)