The generative power of context-free node rewriting in hypergraphs
From MaRDI portal
Recommendations
Cited in
(15)- Node replacement in hypergraphs: simulation of hyperedge replacement, and decidability of confluence
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting
- The string generating power of context-free hypergraph grammars
- Structural properties of context-free sets of graphs generated by vertex replacement
- scientific article; zbMATH DE number 177438 (Why is no real title available?)
- GETGRATS: a summary of scientific results (with annotated bibliography)
- Contextual Hypergraph Grammars – A New Approach to the Generation of Hypergraph Languages
- scientific article; zbMATH DE number 4041304 (Why is no real title available?)
- scientific article; zbMATH DE number 177442 (Why is no real title available?)
- Hypergraph languages of bounded degree
- scientific article; zbMATH DE number 522845 (Why is no real title available?)
- Context-free hypergraph grammars have the same term-generating power as attribute grammars
- Context-free hypergraph grammars with node rewriting
- scientific article; zbMATH DE number 17539 (Why is no real title available?)
- scientific article; zbMATH DE number 1762783 (Why is no real title available?)
This page was built for publication: The generative power of context-free node rewriting in hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1592924)
