Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986
From MaRDI portal
(Redirected from Publication:1097866)
The articles of this volume will be reviewed individually under the abbreviation ``Graph-grammars and their application to computer science, 3rd Int. Workshop, Warrenton/Va. 1986, Lect. Notes Comput. Sci. 291.
Recommendations
- Graph grammars and their application to computer science. 5th international workshop, Williamsburg, VA, USA, November 13--18, 1994. Selected papers
- Graph grammars and their application to computer science. 4th international workshop, Bremen, Germany, March 5-9, 1990. Proceedings
- Introduction to graph grammars with applications to semantic networks
- On structured graph grammars. I
- Structure graphs and structure graph grammars
- scientific article; zbMATH DE number 3988733
- On structured graph grammars. II
- scientific article; zbMATH DE number 1819630
- scientific article; zbMATH DE number 3885330
Cited in
(41)- Graph embedding in SYNCHEM2, an expert system for organic synthesis discovery
- Metatheorems for decision problems on hyperedge replacement graph languages
- Power properties of NLC graph grammars with a polynomial membership problem
- Algorithms for graph problems on BNLC structured garphs
- The string generating power of context-free hypergraph grammars
- Foundations of rule-based design of modular systems
- Hypermap rewriting: A combinatorial approach
- Context-free hypergraph grammars have the same term-generating power as attribute grammars
- Graph grammars and their application to computer science. 4th international workshop, Bremen, Germany, March 5-9, 1990. Proceedings
- On hyperedge replacement and BNLC graph grammars
- Separating \(k\)-separated eNCE graph languages
- The complexity of connectivity problems on context-free graph languages
- Probabilistic hyperedge replacement grammars
- Logical description of context-free graph languages
- 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
- Handle-rewriting hypergraph grammars
- Graph transformations and model-driven engineering: the merits of Manfred Nagl
- Actor grammars
- scientific article; zbMATH DE number 165003 (Why is no real title available?)
- scientific article; zbMATH DE number 1231483 (Why is no real title available?)
- On the interleaving semantics of transformation units -- a step into GRACE
- Pragmatic and semantic aspects of a module concept for graph transformation systems
- The equivalence of boundary and confluent graph grammars on graph languages of bounded degree
- Path-controlled graph grammars for multiresolution image processing and analysis
- Jungle rewriting: an abstract description of a lazy narrowing machine
- Relational structures and their partial morphisms in view of single pushout rewriting
- Single pushout transformations of equationally defined graph structures with applications to actor systems
- Concurrent graph and term graph rewriting
- Exponential time analysis of confluent and boundary eNCE graph languages
- Graph-theoretic properties compatible with graph derivations
- A living monograph for graph transformation
- 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
- Theory of 2-structures. II: Representation through labeled tree families
- 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. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1097866)
