## Find a copy online

### Links to this item

## Find a copy in the library

Finding libraries that hold this item...

## Details

Genre/Form: | Electronic books |
---|---|

Additional Physical Format: | Graph-grammars and their application to computer science (NL-LeOCL)044064586 (OCoLC)17300238 |

Material Type: | Document, Internet resource |

Document Type: | Internet Resource, Computer File |

All Authors / Contributors: |
Hartmut Ehrig; Manfred Nagl; Grzegorz Rozenberg; Azriel Rosenfeld |

ISBN: | 9783540481782 3540481788 3540187715 9783540187714 |

OCLC Number: | 827358491 |

Language Note: | English. |

Description: | 1 online resource : v.: digital. |

Contents: | Tutorial introduction to the algebraic approach of graph grammars -- May we introduce to you: Hyperedge replacement -- An introduction to parallel map generating systems -- Set theoretic approaches to graph grammars -- An introduction to the NLC way of rewriting graphs -- Array grammars -- Graph grammar based specification of interconnection structures for massively parallel computation -- Towards distributed graph grammars -- On partially ordered graph grammars -- A representation of graphs by algebraic expressions and its use for graph rewriting systems -- On context-free sets of graphs and their monadic second-order theory -- Restricting the complexity of regular DNLC languages -- Apex graph grammars -- Graph grammar engineering: A software specification method -- A linguistic formalism for engineering solid modeling -- Graph grammars and diagram editing -- Graphics and their grammars -- On network algebras and recursive equations -- Ada-concurrency specified by graph grammars -- Basic notions of actor grammars -- Embedding rule independent theory of graph grammars -- Supporting the software development process with attributed NLC graph grammars -- Practical applications of precedence graph grammars -- Is parallelism already concurrency? Part 1: Derivations in graph grammars -- Is parallelism already concurrency? Part 2: Non-sequential processes in graph grammars -- Map OL-systems with edge label control: Comparison of marker and cyclic systems -- From 0L and 1L map systems to indeterminate and determinate growth in plant morphogenesis -- Fundamentals of edge-label controlled graph grammars -- Parallelism analysis in rule-based systems using graph grammars -- An efficient algorithm for the solution of hierarchical networks of constraints -- A software development environment based on graph technology -- Map 0L systems with markers -- Graph rewriting with unification and composition -- Complexity of pattern generation via planar parallel binary fission/fusion grammars -- Applications of L-systems to computer imagery -- Advances in array languages -- Rosenfeld's cycle grammars and kolam -- Application of graph grammars in music composing systems -- Boundary NLC and partition controlled graph grammars. |

Series Title: | Lecture notes in computer science, 291. |

Responsibility: | edited by Hartmut Ehrig, Manfred Nagl, Grzegorz Rozenberg, Azriel Rosenfeld. |

### Abstract:

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.

## Reviews

*User-contributed reviews*

Add a review and share your thoughts with other readers.
Be the first.

Add a review and share your thoughts with other readers.
Be the first.

## Tags

Add tags for "Graph-Grammars and Their Application to Computer Science : 3rd International Workshop Warrenton, Virginia, USA, December 2-6, 1986".
Be the first.