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

No author found.

Publication date: 1983

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

Workshop Computer science Graph-grammars

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

Related Items (26)

Node replacements in embedding normal form. ⋮ On the membership problem for regular DNLC grammars ⋮ On the structure of recognizable languages of dependence graphs ⋮ Handle NLC grammars and r. e. languages ⋮ Metatheorems for decision problems on hyperedge replacement graph languages ⋮ Relating graph and term rewriting via Böhm models ⋮ Power properties of NLC graph grammars with a polynomial membership problem ⋮ Path-controlled graph grammars for multiresolution image processing and analysis ⋮ Concurrent graph and term graph rewriting ⋮ Exponential time analysis of confluent and boundary eNCE graph languages ⋮ 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 ⋮ HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting ⋮ The string generating power of context-free hypergraph grammars ⋮ Foundations of rule-based design of modular systems ⋮ On the interleaving semantics of transformation units — A step into GRACE ⋮ Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming ⋮ The complexity of graph languages generated by hyperedge replacement ⋮ Graph Transformations and Model-Driven Engineering: The Merits of Manfred Nagl ⋮ On structured graph grammars. I ⋮ Amalgamation of graph transformations: a synchronization mechanism ⋮ 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. 2nd International Workshop, Haus Ohrbeck, Germany, October 4-8, 1982. Under the auspices of the European Association for Theoretical Computer Science