Pages that link to "Item:Q1121675"
From MaRDI portal
The following pages link to Metatheorems for decision problems on hyperedge replacement graph languages (Q1121675):
Displaying 9 items.
- Metatheorems for decision problems on hyperedge replacement graph languages (Q1121675) (← links)
- The complexity of connectivity problems on context-free graph languages (Q1333400) (← links)
- Logical description of context-free graph languages (Q1384534) (← links)
- A comparison of compatible, finite, and inductive graph properties (Q1812942) (← links)
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting (Q1960412) (← links)
- (Q4852905) (← links)
- Hyperedge replacement with rendezvous (Q5044734) (← links)
- Decision problems for edge grammars (Q5096886) (← links)
- Separation results for separated apex NLC and NCE graph languages (Q5946057) (← links)
