Graph Grammars and Their Application to Computer Science: 4th International Workshop, Bremen, Germany, March 5-9, 1990. Proceedings
Springer Science & Business Media, Sep 11, 1991 - Computers - 703 pages
This volume contains papers selected from the contributions to the 4th International Workshop on Graph Grammars and Their Application to Computer Science. It is intended to provide a rich source of information on the stateof the art and newest trends to researchers active in the area and for scientists who would like to know more about graph grammars. The topics of the papers range from foundations through algorithmic and implemental aspects to various issues that arise in application areas like concurrent computing, functional and logic programming, software engineering, computer graphics, artificial intelligence and biology. The contributing authors are F.-J. Brandenburg, H. Bunke, T.C. Chen, M. Chytil, B. Courcelle, J. Engelfriet, H. G|ttler, A. Habel, D. Janssens, C. Lautemann, B. Mayoh, U. Montanari, M. Nagl, F. Parisi-Presicci, A. Paz, P. Prusinkiewics, M.R. Sleep, A. Rosenfeld, J. Winkowski and others.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
actor algebraic specifications algorithm arcs attribute basic bintree C-edNCE C-graph called cell cellwork collage grammar components Computer Science configuration connected consists construction context context-free corresponding Courcelle Dactl database decorated collage defined Definition denoted derivation tree diagram direct derivation edge labels Ehrig elementary cycle embedding equations example finite set formal formulas function given gluing graph G graph grammars graph languages graph morphisms graph productions graph rewriting graph transformations graphic Grzegorz Rozenberg hand side hyperedge replacement hypergraph implementation isomorphic jungle Kreowski L-systems Lecture Notes left-hand side Lemma LNCS logic program monadic second-order node labels nonterminal normal form notion object occurrence parallel parallel collage pattern polynomial problem pullback pushout relation representation represented resp result rewrite rule right-hand side Rozenberg second-order logic semantics sequence set of graphs string structure subgraph term rewriting systems Theorem theory variables vertex vertices wall