Abstract is missing.
- Introduction to the Algebraic Theory of Graph Grammars (A Survey)Hartmut Ehrig. 1-69
- A Tutorial and Bibliographical Survey on Graph GrammarsManfred Nagl. 70-126
- Partially-Additive Monoids, Graph-Growing, and the Algebraic Semantics of Recursive CallsMichael A. Arbib, Ernest G. Manes. 127-138
- Rewriting Systems as a Tool for Relational Data Base DesignCarlo Batini, Alessandro D Atri. 139-154
- Programmed Graph GrammarsHorst Bunke. 155-166
- Shortest Path Problems and Tree Grammars: An Algebraic FrameworkAlfonso Catalano, Stefania Gnesi, Ugo Montanari. 167-179
- Constructive Specifications of Abstract Data Types by ReplacementsHans-Dieter Ehrich, V. G. Lohberger. 180-191
- Decomposition of Graph Grammar Productions and DerivationsHartmut Ehrig, Barry K. Rosen. 192-205
- Locally Star Sluing Formulas for a Class of Parallel Graph GrammarsHartmut Ehrig, Axel Liedtke. 206-223
- Transformations of Data Base StructuresAntonio L. Furtado. 224-236
- Explicit versus Implicit Parallel Rewriting on GraphsEberhard Grötsch, Manfred Nagl. 237-254
- Two-Level Graph GrammarsWolfgang Hesse. 255-269
- A Pumping Lemma for Context-Free Graph LanguagesHans-Jörg Kreowski. 270-283
- Two-Dimensional, Differential, Intercalary Plant Tissue Growth and Parallel Graph Generating and Graph Recurrence SystemsJacqueline Lück, Hermann B. Lück. 284-300
- Parallel Generation of Maps: Developmental Systems for Cell LayersAristid Lindenmayer, Grzegorz Rozenberg. 301-316
- Processes in StructuresAndrea Maggiolo-Schettini, Józef Winkowski. 317-330
- Map Grammars: Cycles and the Algebraic ApproachKristian Nyrup, Brian H. Mayoh. 331-340
- On Multilevel-Graph GrammarsAlexander Ollongren. 341-349
- Graph Grammars and Operational SemanticsPeter Padawitz. 350-366
- Complexity of Pattern Generation by Map-L-SystemsAzaria Paz, Yoav Raz. 367-378
- A Graph Grammar that Describes the Set of Two-Dimensional Surface NetworksJohn L. Pfaltz. 379-388
- Definition of Programming Language Semantics Using Grammars for Hierarchical GraphsTerrence W. Pratt. 389-400
- Determinism in Relational SystemsVaclav Rajlich. 401-408
- Analysis of Programs by Reduction of Their StructureManfred Rosendahl, Karl Peter Mankwald. 409-417
- Graphs of ProcessorsWalter J. Savitch. 418-425
- Definitional Mechanisms for Conceptual GraphsJohn F. Sowa. 426-439
- A Graph-Like Lambda Calculus for Which Leftmost-Overmost Reduction is OptimalJohn Staples. 440-455
- Relationships Between Graph Grammars and the Design and Analysis of Concurrent SoftwareJack C. Wileden. 456-463
- Cellular Graph AutomataAngela Y. Wu, Azriel Rosenfeld. 464-475