Handbook Of Graph Grammars And Computing By Graph Transformation, Vol 1: Foundations (Hardcover)

Grzegorz Rozenberg

ISBN 10: 9810228848 / ISBN 13: 9789810228842

Published by World Scientific Publishing Co Pte Ltd, Singapore, 1997

About this Item

Hardcover. 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, modelling 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 langauge 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 "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, (hyer)edge-based rewriting, programmed graph rewriting, and 2-structures. The book has been written in a tutorial/survey style to enhance its usefulness. This first volume 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. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Seller Inventory # 9789810228842

Bibliographic Details

• Title: Handbook Of Graph Grammars And Computing By Graph Transformation, Vol 1: Foundations (Hardcover)
• Publisher: World Scientific Publishing Co Pte Ltd, Singapore
• Publication Date: 1997
• Language: English
• ISBN 10: 9810228848
• ISBN 13: 9789810228842
• Binding: Hardcover
• Condition: new

About this title

Synopsis

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.