| Graph-Grammars and Their Application to Computer Science: 3rd International Workshop, Warrenton, Virginia, Usa, December 2-6, 1986 1987 Edition Contributor(s): Ehrig, Hartmut (Editor), Nagl, Manfred (Editor), Rozenberg, Grzegorz (Editor) |
|
 |
ISBN: 3540187715 ISBN-13: 9783540187714 Publisher: Springer OUR PRICE: $104.49 Product Type: Paperback - Other Formats Published: December 1987 Annotation: The generic term "graph-grammars" refers to a variety of methods for specifying (possibly infinite) sets of graphs or sets of maps. The area of graph-grammars originated in the late 60s motivated by considerations concerning pattern recognition - since then the list of areas which have interacted with the development of graph-grammars has grown quite impressively. It includes pattern recognition, software specification and development, VLSI layout schemes, data bases, lambda-calculus, analysis of concurrent systems, massively parallel computer architectures, incremental compilers, computer animation, complexity theory, developmental biology, music composition, representation of physical solids, and many others. This volume is based on the contributions presented at the third international workshop on graph-grammars and their applications, held in Warrenton, Virginia, USA in December 1986. Aiming at the best possible representation of the field not all of the papers presented at the meeting appear in this volume and some of the papers from this volume were not presented at the workshop. The volume consists of two parts: Part I presents tutorial introductions to a number of basic graph and map rewriting mechanisms. Part II contains technical contributions. This collection of papers provides the reader with an up-to-date overview of current trends in graph-grammars. |
| Additional Information |
| BISAC Categories: - Mathematics | Graphic Methods - Computers | Computer Science - Mathematics | Logic |
| Dewey: 511.5 |
| Series: Lecture Notes in Computer Science |
| Physical Information: 1.26" H x 6.14" W x 9.21" (1.90 lbs) 622 pages |