The following pages link to (Q3714485):
Displaying 16 items.
- Nonterminal separation in graph grammars (Q804300) (← links)
- Boundary graph grammars with dynamic edge relabeling (Q909478) (← links)
- A comparison of boundary graph grammars and context-free hypergraph grammars (Q918718) (← links)
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars (Q1102759) (← links)
- Order independent NCE grammars recognized in polynomial time (Q1182091) (← links)
- Hypergraph languages of bounded degree (Q1318469) (← links)
- Logical description of context-free graph languages (Q1384534) (← links)
- Linear graph grammars: Power and complexity (Q1825679) (← links)
- The complexity of the \(K_{n,n}\)-problem for node replacement graph languages (Q1854438) (← links)
- Graph traversal and graph transformation (Q1885899) (← links)
- Handle-rewriting hypergraph grammars (Q2366278) (← links)
- Complexity of boundary graph languages (Q3479528) (← links)
- Adaptive Star Grammars for Graph Models (Q3540417) (← links)
- The bounded degree problem for non-obstructing eNCE graph grammars (Q4645278) (← links)
- Node replacement in hypergraphs: Simulation of hyperedge replacement, and decidability of confluence (Q4645290) (← links)
- (Q5661155) (← links)