Graph-Grammars and Their Application to Computer Science

1. Front Matter

   PDF

2. Tutorial introduction to the algebraic approach of graph grammars

   • Hartmut Ehrig

   Pages 1-14

3. May we introduce to you: Hyperedge replacement

   • Annegret Habel, Hans-Jörg Kreowski

   Pages 15-26

4. An introduction to parallel map generating systems

   • Aristid Lindenmayer

   Pages 27-40

5. Set theoretic approaches to graph grammars

   • Manfred Nagl

   Pages 41-54

6. An introduction to the NLC way of rewriting graphs

   • G. Rozenberg

   Pages 55-66

7. Array grammars

   • Azriel Rosenfeld

   Pages 67-70

8. Graph grammar based specification of interconnection structures for massively parallel computation

   • Duane A. Bailey, Janice E. Cuny

   Pages 71-85

9. Towards distributed graph grammars

   • Paul Boehm, Hartmut Ehrig, Udo Hummert, Michael Löwe

   Pages 86-98

10. On partially ordered graph grammars

    • Franz J. Brandenburg

    Pages 99-111

11. A representation of graphs by algebraic expressions and its use for graph rewriting systems

    • Bruno Courcelle

    Pages 112-132

12. On context-free sets of graphs and their monadic second-order theory

    • Bruno Courcelle

    Pages 133-146

13. Restricting the complexity of regular DNLC languages

    • IJsbrand Jan Albersberg, Joost Engelfriet, Grzegorz Rozenberg

    Pages 147-166

14. Apex graph grammars

    • Joost Engelfriet, George Leih, Grzegorz Rozenberg

    Pages 167-185

15. Graph grammar engineering: A software specification method

    • Gregor Engels, Claus Lewerentz, Wilhelm Schäfer

    Pages 186-201

16. A linguistic formalism for engineering solid modeling

    • Patrick Fitzhorn

    Pages 202-215

17. Graph grammars and diagram editing

    • Herbert Göttler

    Pages 216-231

18. Graphics and their grammars

    • L. Hess, B. H. Mayoh

    Pages 232-249

19. On network algebras and recursive equations

    • Günter Hotz, Reiner Kolla, Paul Molitor

    Pages 250-261

20. Ada-concurrency specified by graph grammars

    • Manfred Jackel

    Pages 262-279

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.

• Algebra
• Animation
• Attribut
• Composing
• Derivation
• Master Patient Index
• Radiologieinformationssystem
• algorithm
• algorithms
• biology
• calculus
• complexity
• complexity theory
• equation
• modeling

Policies and ethics