Handbook of Graph Grammars and Computing by Graph Transformation
Sold by Ammareal, Morangis, France
AbeBooks Seller since 29 August 2016
Used - Hardcover
Condition: Used - Fine
Quantity: 1 available
Add to basketSold by Ammareal, Morangis, France
AbeBooks Seller since 29 August 2016
Condition: Used - Fine
Quantity: 1 available
Add to basketAncien livre de bibliothèque avec équipements. Couverture différente. Edition 2003. Tome 1. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Different cover. Edition 2003. Volume 1. Ammareal gives back up to 15% of this item's net price to charity organizations.
Seller Inventory # G-128-693
Graph grammars originated in the late 60s, motivated by considerations about pattern recognition and compiler construction. Since then the list of areas which have interacted with the development of graph grammars has grown quite impressively. Besides the aforementioned areas it includes software specification and development, VLSI layout schemes, database design, modeling of concurrent systems, massively parallel computer architectures, logic programming, computer animation, developmental biology, music composition, visual languages, and many others.
The area of graph grammars and graph transformations generalizes formal language theory based on strings and the theory of term rewriting based on trees. As a matter of fact within the area of graph grammars, graph transformation is considered a fundamental programming paradigm where computation includes specification, programming, and implementation.
Over the last 25-odd years graph grammars have developed at a steady pace into a theoretically attractive and well-motivated research field. In particular, they are now based on very solid foundations, which are presented in this volume. Volume 1 of the indispensable Handbook of Graph Grammars and Computing by Graph Transformations includes a state-of-the-art presentation of the foundations of all the basic approaches to rule-based graph specification and transformation: algebraic approach, logic approach, node-based rewriting, (hyper)edge-based rewriting, programmed graph rewriting, and 2-structures. The book has been written in a tutorial/survey style to enhance its usefulness.
"About this title" may belong to another edition of this title.