On the relation between graph grammars and graph L-systems

  • Manfred Nagl
Section A Algebraic & Constructive Theory of Machines, Computations and Languages
Part of the Lecture Notes in Computer Science book series (LNCS, volume 56)


Sequential graph rewriting systems called graph or web grammars have been extensively studied within the last years, while parallel graph rewriting systems, named graph L-systems, are a very recent topic of research. In the following a relation between two representatives of these graph rewriting models is given: [CF]=[PEGL], where [CF] is the class of context free graph languages in [12], and [PEGL] is the class of propagating extended graph L-languages given in [13]. The validity of this relation in the graph case, opposite to the string case, is due to the fact that graphs derived in both rewriting systems have nonterminal edges. These edges may occur in the derivation of a graph belonging to the language of such a system, but not in the graph itself. Furthermore, the sequential mechanism is very powerful with respect to the transformation of the embeddings of the replaced graphs, and the parallel mechanism is very general with respect to the transformation of the connections from mother nodes to daughter graphs. These tools allow to simulate a sequential derivation step by two parallel ones and, vice versa, to simulate a parallel derivation step by a sequence of sequential steps.


Edge Label Node Label Derivation Step Graph Grammar Connection Structure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Abe, N./Mizumoto, M./Toyoda, J.-I./Tanaka, K.: Web Grammars and Several Graphs, Journ. Comp. Sci. 7, 37–65 (1973).Google Scholar
  2. [2]
    Brendel,W./Nagl,M./Weber,D.: Implementation of Sequential and Parallel Graph Rewriting Systems, unpublished manuscript, University of Erlangen (1977).Google Scholar
  3. [3]
    Culik, K.II/Lindenmayer, A.: Parallel Graph Generating and Graph Recurrence Systems for Multidimensional Development, Int. Journ. General Syst. 3, 53–66 (1976).Google Scholar
  4. [4]
    Ehrig, H./Kreowsky, H.J.: Parallel Graph Grammars, in A. Lindenmayer/G. Rozenberg(Ed.): Automata, Languages, Development, Amsterdam: North Holland (1976).Google Scholar
  5. [5]
    Ehrig,H./Pfender,H./Schneider,H.J.: Graph-Grammars: An algebraic approach, Proc. 14th Annual Conf. on Switching and Automata Theory, 167–180 (1973).Google Scholar
  6. [6]
    Ehrig, H./Rozenberg, G.: Some Definitional Suggestions for Parallel Graph Grammars, in A. Lindenmayer/G. Rozenberg(Ed.): Automata, Languages, Development, Amsterdam: North Holland (1976).Google Scholar
  7. [7]
    Grötsch,E./Nagl,M.: Comparison between Explicit and Implicit Graph L-Systems, unpublished manuscript, University of Erlangen (1977).Google Scholar
  8. [8]
    Levy, L.S./Yueh, K.: On n-diagram graph grammars, unpublished manuscript, University of Pennsylvania, Philadelphia (1977).Google Scholar
  9. [9]
    Lindenmayer, A.: Mathematical Models for Cellular Interactions in Development, Parts I and II, Journ. Theor. Biology 18, 280–315 (1968).Google Scholar
  10. [10]
    Mayoh, B.H.: Multidimensional Lindenmayer Organisms, in G. Rozenberg/A. Salomaa(Ed.): L-Systems, Lect. Notes in Comp. Sci. 15, 302–326, Berlin: Springer-Verlag (1974).Google Scholar
  11. [11]
    Montanari, U.: Separable Graphs, Planar Graphs and Web Grammars, Inf. Contr. 16, 243–267 (1970).Google Scholar
  12. [12]
    Nagl, M.: Formal Languages of Labelled Graphs, Computing 16, 113–137 (1976).Google Scholar
  13. [13]
    Nagl, M.: On a Generalization of Lindenmayer-Systems to Labelled Graphs, in A. Lindenmayer/G. Rozenberg(Ed.): Automata,Languages,Development, 487–508, Amsterdam: North Holland (1976).Google Scholar
  14. [14]
    Nagl, M. Graph Rewriting Systems and Their Application in Biology, Lect. Notes in Biomathematics 11, 135–156 (1976).Google Scholar
  15. [15]
    Nagl, M.: On the Relation between Graph Grammars and Graph Lindenmayer-Systems, Arbitsber.d.Inst.f.Math.Masch.u.Datenver. 9, 1, 3–32, University of Erlangen (1976).Google Scholar
  16. [16]
    Pavlidis, T.: Linear and Context-free Graph Grammars, Journ. ACM 19, 11–23 (1972).Google Scholar
  17. [17]
    Pfaltz,J.L./Rosenfeld,A.: Web Grammars, Proc. Int. Joint Conf. Artif. Int., 609–619 (1969).Google Scholar
  18. [18]
    Rosen, B.: Deriving Graphs from Graphs by Applying a Production, Acta Informatica 4, 337–357 (1975).Google Scholar
  19. [19]
    Rosenfeld, A./Milgram, D.L.: Web automata and web grammars, Machine Intelligence 7, 307–324 (1972).Google Scholar
  20. [20]
    Schneider,H.J.: Chomsky-Systeme für partielle Ordnungen, Arbeitsber.d.Inst.f.Math.Masch.u.Datenver. 3, 3, University of Erlangen (1970).Google Scholar
  21. [21]
    Schneider, H.J./Ehrig, H.: Grammars on Partial Graphs, Acta Informatica 6, 297–316 (1976).Google Scholar
  22. [22]
    Schneider,H.J.: Graph Grammars, in this volume.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Manfred Nagl
    • 1
  1. 1.Institut für Mathematische Maschinen und Datenverarbeitung Lehrstuhl für ProgrammiersprachenUniversity of ErlangenFed. Rep. of Germany

Personalised recommendations