Pages that link to "Item:Q1114416"
From MaRDI portal
The following pages link to Nonterminal bounded NLC graph grammars (Q1114416):
Displayed 6 items.
- Boundary graph grammars with dynamic edge relabeling (Q909478) (← links)
- Power properties of NLC graph grammars with a polynomial membership problem (Q1129012) (← links)
- A hierarchy of eNCE families of graph languages (Q1389767) (← links)
- Linear graph grammars: Power and complexity (Q1825679) (← links)
- The complexity of graph languages generated by hyperedge replacement (Q2277851) (← links)
- Separation results for separated apex NLC and NCE graph languages (Q5946057) (← links)