Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986

No author found.

Publication date: 1987

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Workshop Computer science Graph-grammars Warrenton/Virginia

Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Conference proceedings and collections of articles (00Bxx)

Related Items (39)

Node replacements in embedding normal form. ⋮ The complexity of connectivity problems on context-free graph languages ⋮ Handle-rewriting hypergraph grammars ⋮ The equivalence of boundary and confluent graph grammars on graph languages of bounded degree ⋮ Graph embedding in SYNCHEM2, an expert system for organic synthesis discovery ⋮ Probabilistic hyperedge replacement grammars ⋮ Metatheorems for decision problems on hyperedge replacement graph languages ⋮ Relating graph and term rewriting via Böhm models ⋮ Logical description of context-free graph languages ⋮ Power properties of NLC graph grammars with a polynomial membership problem ⋮ 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 ⋮ 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 ⋮ HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting ⋮ Unnamed Item ⋮ 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 ⋮ On the interleaving semantics of transformation units — A step into GRACE ⋮ Pragmatic and semantic aspects of a module concept for graph transformation systems ⋮ Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming ⋮ Context-free hypergraph grammars have the same term-generating power as attribute grammars ⋮ Actor grammars ⋮ Graph Transformations and Model-Driven Engineering: The Merits of Manfred Nagl ⋮ On structured graph grammars. I ⋮ Unnamed Item ⋮ Linear graph grammars: Power and complexity ⋮ On hyperedge replacement and BNLC graph grammars ⋮ Nonterminal separation in graph grammars ⋮ Separating \(k\)-separated eNCE graph languages

This page was built for publication: Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986