Graph-grammars and their application to computer science. 2nd International Workshop, Haus Ohrbeck, Germany, October 4-8, 1982. Under the auspices of the European Association for Theoretical Computer Science
From MaRDI portal
(Redirected from Publication:1839237)
Graph-grammars and their application to computer science. 2nd International Workshop, Haus Ohrbeck, Germany, October 4-8, 1982. ''Under the auspices of the European Association for Theoretical Computer Science''
Graph-grammars and their application to computer science. 2nd International Workshop, Haus Ohrbeck, Germany, October 4-8, 1982. ''Under the auspices of the European Association for Theoretical Computer Science''
Cited in
(26)- On the membership problem for regular DNLC grammars
- Handle NLC grammars and r. e. languages
- Metatheorems for decision problems on hyperedge replacement graph languages
- Power properties of NLC graph grammars with a polynomial membership problem
- The string generating power of context-free hypergraph grammars
- Foundations of rule-based design of modular systems
- On hyperedge replacement and BNLC graph grammars
- Separating \(k\)-separated eNCE graph languages
- Amalgamation of graph transformations: a synchronization mechanism
- Linear graph grammars: Power and complexity
- Node replacements in embedding normal form.
- Relating graph and term rewriting via Böhm models
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting
- The complexity of graph languages generated by hyperedge replacement
- Graph transformations and model-driven engineering: the merits of Manfred Nagl
- On the interleaving semantics of transformation units -- a step into GRACE
- Path-controlled graph grammars for multiresolution image processing and analysis
- On the structure of recognizable languages of dependence graphs
- Concurrent graph and term graph rewriting
- Exponential time analysis of confluent and boundary eNCE graph languages
- Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
- On structured graph grammars. I
- Nonterminal separation in graph grammars
- Boundary graph grammars with dynamic edge relabeling
- Introduction to graph grammars with applications to semantic networks
- A comparison of boundary graph grammars and context-free hypergraph grammars
This page was built for publication: Graph-grammars and their application to computer science. 2nd International Workshop, Haus Ohrbeck, Germany, October 4-8, 1982. Under the auspices of the European Association for Theoretical Computer Science
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1839237)
