Recommendations
- scientific article; zbMATH DE number 177419
- On sequential and parallel node-rewriting graph grammars
- Context-free hypergraph grammars with node rewriting
- Node replacement graph grammars with dynamic node relabeling
- On sequential and parallel node-rewriting graph grammars, II
- On graph rewritings
- scientific article; zbMATH DE number 3878382
- Graph expressions and graph rewritings
- Graph grammars with string-regulated rewriting
Cites work
- scientific article; zbMATH DE number 3846896 (Why is no real title available?)
- scientific article; zbMATH DE number 3856429 (Why is no real title available?)
- scientific article; zbMATH DE number 3819112 (Why is no real title available?)
- scientific article; zbMATH DE number 3633737 (Why is no real title available?)
- scientific article; zbMATH DE number 3410623 (Why is no real title available?)
- Decision problems for node label controlled graph grammars
- On the structure of node-label-controlled graph languages
- Restrictions, extensions, and variations of NLC grammars
Cited in
(12)- On sequential and parallel node-rewriting graph grammars
- On structured graph grammars. I
- scientific article; zbMATH DE number 4049103 (Why is no real title available?)
- On sequential and parallel node-rewriting graph grammars, II
- Non-size increasing graph rewriting for natural language processing
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- Apex graph grammars and attribute grammars
- Context-free hypergraph grammars with node rewriting
- scientific article; zbMATH DE number 3856429 (Why is no real title available?)
- scientific article; zbMATH DE number 177419 (Why is no real title available?)
- On hyperedge replacement and BNLC graph grammars
- scientific article; zbMATH DE number 4049106 (Why is no real title available?)
This page was built for publication: Note on node-rewriting graph grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q796997)
