The following pages link to (Q3785994):
Displaying 10 items.
- Nonterminal separation in graph grammars (Q804300) (← links)
- Boundary graph grammars with dynamic edge relabeling (Q909478) (← links)
- Nonterminal bounded NLC graph grammars (Q1114416) (← links)
- Power properties of NLC graph grammars with a polynomial membership problem (Q1129012) (← links)
- On hyperedge replacement and BNLC graph grammars (Q1308742) (← links)
- The complexity of connectivity problems on context-free graph languages (Q1333400) (← links)
- Context-free graph languages of bounded degree are generated by apex graph grammars (Q1338891) (← links)
- Linear graph grammars: Power and complexity (Q1825679) (← links)
- Handle-rewriting hypergraph grammars (Q2366278) (← links)
- Complexity of boundary graph languages (Q3479528) (← links)
