Graph grammars and their application to computer science. 4th international workshop, Bremen, Germany, March 5-9, 1990. Proceedings
From MaRDI portal
Publication:1202145
zbMath0753.00023MaRDI QIDQ1202145
No author found.
Publication date: 23 January 1993
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)
Related Items
Node replacements in embedding normal form., Handle-rewriting hypergraph grammars, The generating power of boundary NLC graph grammars and cycle graphs, Probabilistic hyperedge replacement grammars, Non-perturbative graph languages, halting problem and complexity, 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, Syntax and semantics of hybrid database languages, A computational model for generic graph functions, Relational structures and their partial morphisms in view of single pushout rewriting, Logic based structure rewriting systems, Dynamic labeled 2-structures with variable domains, Concurrent graph and term graph rewriting, Using programmed graph rewriting for the formal specification of a configuration management system, Exponential time analysis of confluent and boundary eNCE graph languages, Bypass strong V-structures and find an isomorphic labelled subgraph in linear time, Graph grammars, insertion Lie algebras, and quantum field theory, Relational matching for graphical calculi of relations, On the interleaving semantics of transformation units — A step into GRACE, Hierarchically distributed graph transformation, Graph automata for linear graph languages, Drawing graphs with attribute graph grammars, Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming, Visual Modeling of Distributed Object Systems by Graph Transformation, Separating \(k\)-separated eNCE graph languages
