Graph-grammars and their application to computer science and biology. International workshop Bad Honnef, October 30 November 3, 1978
From MaRDI portal
Publication:1254289
zbMath0398.00019MaRDI QIDQ1254289
No author found.
Publication date: 1979
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to biology (92-06) Conference proceedings and collections of articles (00Bxx)
Related Items
Characteristics of graph languages generated by edge replacement, Constraint relaxation may be perfect, Metatheorems for decision problems on hyperedge replacement graph languages, Logic based structure rewriting systems, Parallelism and concurrency of graph manipulations, On the structure of node-label-controlled graph languages, A characterization of context-free string languages by directed node- label controlled graph grammars, 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, Unnamed Item, On the interleaving semantics of transformation units — A step into GRACE, Software integration problems and coupling of graph grammar specifications, Comparing Notions of Hierarchical Graph Transformation1 1This work has been partially supported by the ESPRIT Working Group Applications of Graph Transformation (Appligraph)., The complexity of graph languages generated by hyperedge replacement, Representing graph families with edge grammars, On structured graph grammars. I, Amalgamation of graph transformations: a synchronization mechanism, Software specification using graph grammars, On hyperedge replacement and BNLC graph grammars, Transformations of structures: An algebraic approach
