Pages that link to "Item:Q4645290"
From MaRDI portal
The following pages link to Node replacement in hypergraphs: Simulation of hyperedge replacement, and decidability of confluence (Q4645290):
Displaying 4 items.
- The complexity of the \(K_{n,n}\)-problem for node replacement graph languages (Q1854438) (← links)
- Context-free hypergraph grammars with node rewriting (Q4923541) (← links)
- Node rewriting in graphs and hypergraphs: A categorical framework (Q5958766) (← links)
- Node rewriting in hypergraphs (Q6550530) (← links)