Skip to main content
SpringerLink
Log in
Book cover

International Conference on Fundamentals of Computation Theory

FCT 1977: Fundamentals of Computation Theory pp 142–151Cite as

On the relation between graph grammars and graph L-systems

  • Section A Algebraic & Constructive Theory of Machines, Computations and Languages
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 56))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. Brendel,W./Nagl,M./Weber,D.: Implementation of Sequential and Parallel Graph Rewriting Systems, unpublished manuscript, University of Erlangen (1977).

    Google Scholar 

  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. Ehrig, H./Kreowsky, H.J.: Parallel Graph Grammars, in A. Lindenmayer/G. Rozenberg(Ed.): Automata, Languages, Development, Amsterdam: North Holland (1976).

    Google Scholar 

  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. 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. Grötsch,E./Nagl,M.: Comparison between Explicit and Implicit Graph L-Systems, unpublished manuscript, University of Erlangen (1977).

    Google Scholar 

  8. Levy, L.S./Yueh, K.: On n-diagram graph grammars, unpublished manuscript, University of Pennsylvania, Philadelphia (1977).

    Google Scholar 

  9. Lindenmayer, A.: Mathematical Models for Cellular Interactions in Development, Parts I and II, Journ. Theor. Biology 18, 280–315 (1968).

    Google Scholar 

  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. Montanari, U.: Separable Graphs, Planar Graphs and Web Grammars, Inf. Contr. 16, 243–267 (1970).

    Google Scholar 

  12. Nagl, M.: Formal Languages of Labelled Graphs, Computing 16, 113–137 (1976).

    Google Scholar 

  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. Nagl, M. Graph Rewriting Systems and Their Application in Biology, Lect. Notes in Biomathematics 11, 135–156 (1976).

    Google Scholar 

  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. Pavlidis, T.: Linear and Context-free Graph Grammars, Journ. ACM 19, 11–23 (1972).

    Google Scholar 

  17. Pfaltz,J.L./Rosenfeld,A.: Web Grammars, Proc. Int. Joint Conf. Artif. Int., 609–619 (1969).

    Google Scholar 

  18. Rosen, B.: Deriving Graphs from Graphs by Applying a Production, Acta Informatica 4, 337–357 (1975).

    Google Scholar 

  19. Rosenfeld, A./Milgram, D.L.: Web automata and web grammars, Machine Intelligence 7, 307–324 (1972).

    Google Scholar 

  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. Schneider, H.J./Ehrig, H.: Grammars on Partial Graphs, Acta Informatica 6, 297–316 (1976).

    Google Scholar 

  22. Schneider,H.J.: Graph Grammars, in this volume.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Mathematische Maschinen und Datenverarbeitung Lehrstuhl für Programmiersprachen, University of Erlangen, Fed. Rep. of Germany

    Manfred Nagl

Authors
  1. Manfred Nagl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marek Karpiński

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nagl, M. (1977). On the relation between graph grammars and graph L-systems. In: Karpiński, M. (eds) Fundamentals of Computation Theory. FCT 1977. Lecture Notes in Computer Science, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08442-8_80

Download citation

  • DOI: https://doi.org/10.1007/3-540-08442-8_80

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08442-6

  • Online ISBN: 978-3-540-37084-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation