Pages that link to "Item:Q1114416"
From MaRDI portal
The following pages link to Nonterminal bounded NLC graph grammars (Q1114416):
Displaying 14 items.
- Nonterminal separation in graph grammars (Q804300) (← links)
- Boundary graph grammars with dynamic edge relabeling (Q909478) (← links)
- Restrictions on NLC graph grammars (Q1059402) (← 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)
- A hierarchy of the class of apex NLC graph languages by bounds on the number of nonterminal nodes in productions (Q1920234) (← links)
- The complexity of graph languages generated by hyperedge replacement (Q2277851) (← links)
- (Q3316615) (← links)
- (Q3347320) (← links)
- Context-free NCE graph grammars (Q3974863) (← links)
- The bounded degree problem for non-obstructing eNCE graph grammars (Q4645278) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902525) (← links)
- Separation results for separated apex NLC and NCE graph languages (Q5946057) (← links)