Note on node-rewriting graph grammars
The purpose of the paper is to discuss the relationship of two lines of development within the theory of graph grammars: the Berlin approach based on the glueing of graphs and the NLC (node label controlled) approach. In Berlin grammars an application condition is used for subgraph replacement whereas this is not the case in NLC grammars. In order to make the comparison possible, Berlin grammars without the application condition, called node-glueing grammars, are considered; on the other side a subclass of NLC grammars, NUNLC (neighbourhood-uniform- node-label-controlled) grammars is taken and it is proved that for every grammar of one type it is possible to construct one of the other type such that derivations are the same.
- 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
- Decision problems for node label controlled graph grammars
- 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?)
- On the structure of node-label-controlled graph languages
- Restrictions, extensions, and variations of NLC grammars
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- Apex graph grammars and attribute grammars
- On hyperedge replacement and BNLC graph grammars
- On sequential and parallel node-rewriting graph grammars
- scientific article; zbMATH DE number 3856429 (Why is no real title available?)
- On sequential and parallel node-rewriting graph grammars, II
- scientific article; zbMATH DE number 4049103 (Why is no real title available?)
- scientific article; zbMATH DE number 4049106 (Why is no real title available?)
- scientific article; zbMATH DE number 177419 (Why is no real title available?)
- Non-size increasing graph rewriting for natural language processing
- Context-free hypergraph grammars with node rewriting
- On structured graph grammars. I
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)
