Node replacement graph grammars with dynamic node relabeling
From MaRDI portal
Publication:2342679
Recommendations
Cites work
- A hierarchy of eNCE families of graph languages
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- Boundary graph grammars with dynamic edge relabeling
- Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
- Edge-label controlled graph grammars
- Graph grammars with neighbourhood-controlled embedding
- Handbook of Graph Grammars and Computing by Graph Transformation
- Handle NLC grammars and r. e. languages
- Handle-rewriting hypergraph grammars
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- Linear graph grammars: Power and complexity
- Nonterminal separation in graph grammars
- On sequential and parallel node-rewriting graph grammars
- On the structure of node-label-controlled graph languages
- Restrictions, extensions, and variations of NLC grammars
- Separating \(k\)-separated eNCE graph languages
- Separation results for separated apex NLC and NCE graph languages
Cited in
(7)- Graph grammars according to the type of input and manipulated data: a survey
- The complexity of the \(K_{n,n}\)-problem for node replacement graph languages
- Node replacements in embedding normal form.
- scientific article; zbMATH DE number 177419 (Why is no real title available?)
- scientific article; zbMATH DE number 1504826 (Why is no real title available?)
- Note on node-rewriting graph grammars
- Boundary graph grammars with dynamic edge relabeling
This page was built for publication: Node replacement graph grammars with dynamic node relabeling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2342679)
