Skip to main content
SpringerLink
Log in

Embedding theorems in the algebraic theory of graph grammars

  • Section B Computation Theory in Category
  • Conference paper
  • First Online:
Book cover Fundamentals of Computation Theory (FCT 1977)

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

Included in the following conference series:

Abstract

In the first section we start with an overview of basic constructions and results in the algebraic theory of graph grammars. The rest of the paper is devoted to two embedding theorems for graph grammars which are most important for several applications and implementation purposes: Locally defined derivation sequences can be extended to global ones provided that the embedding of the start graph of the local derivation is noncritical in a specific sense. This is shown for two different types of embeddings.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ehrig, H., Kreowski, H.-J.: Categorical Approach to Graphic Systems and Graph Grammars, Conf. Report Algebraic System Theory, Udine 1975, Springer Lect. Notes in Econ. Math. Syst. 131 (1976), 323–351

    Google Scholar 

  2. Ehrig, H., Kreowski, H.-J.: Parallelism of Manipulations in Multidimensional Information Structures, Proc. Conf. Math. Foundations of Comp. Sci., Gdansk 1976, Springer Lect. Notes in Comp. Sci. 45 (1976), 284–293

    Google Scholar 

  3. Ehrig, H., Kreowski, H.-J.: Contributions to the Algebraic Theory of Graph Grammars, Forschungsbericht FB 20, TU Berlin, 76–22

    Google Scholar 

  4. Ehrig, H., Pfender, M., Schneider, H.J.: GRAPH GRAMMARS: An Algebraic Approach, Proc. IEEE Conf. on Automata and Switching Theory, Iowa City 1973, 167–180

    Google Scholar 

  5. Ehrig, H., Rosen, B.K.: Commutativity of Independent Transformations on Complex Objects, IBM Research Report, RC 6251, Oct 1976

    Google Scholar 

  6. Ehrig, H., Rosen, B.K.: The Mathematics of Record Handling, Proc. Conf. 4th ICALP, Turku 1977

    Google Scholar 

  7. Ehrig, H., Rosen, B.K.: Rapid Evaluation of Recursively Defined Functions: An Application of Algebraic Graph Theory (in preparation)

    Google Scholar 

  8. Ehrig, H., Tischer, K.W.: Graph Grammars and Applications to Specialization and Evolution in Biology, in Journ. Comp. Syst. Sci., vol 11, No 2 (1975), 212–236, also in Forschungsbericht FB 20, TU Berlin, 74–31

    Google Scholar 

  9. Ehrig, H., Tischer, K.W.: Derivations of Stochastic Graphs, Proceedings Conference on Uniformly Structured Automata Theory and Logic, Tokyo 1975, 1–6

    Google Scholar 

  10. Furtado, A.L., Gotlieb, C.D.: Data Schemata Based on Directed Graphs, Techn. Report No 70, Dept. Comp. Sci., University of Toronto, 1974

    Google Scholar 

  11. Farrow, R., Kennedy, K., Zucconi, L.: Graph Grammars and Global Program Data Flow Analysis, Proc. 17th Ann. IEEE Symp. on Foundations of Comp. Sci., Houston, 1976

    Google Scholar 

  12. Franck, R.: PLAN2D — Syntaxanalyse von Präzedenz-Graph-Grammatiken, Dissertation, Techn. Universität Berlin, FB 20, 1975

    Google Scholar 

  13. Griffiths, T.V.: Some Remarks on Derivations in General Rewriting Systems, Information and Control 12, 1968, 27–54

    Google Scholar 

  14. Lindenmayer, A., Rozenberg, G. (Editors): Automata, Languages, Development, North-Holland, Amsterdam 1976

    Google Scholar 

  15. Kreowski, H.-J.: Transformations of Derivation Sequences in Graph Grammars, this volume

    Google Scholar 

  16. Rosen, B.K.: Tree-Manipulating Systems and Church-Rosser Theorems, Journ. ACM 20, 1, 1973, 160–187

    Google Scholar 

  17. Rosen, B.K.: A Church-Rosser Theorem for Graph Grammars (announcement), SIGACT News 7, 3, 1975, 26–31

    Google Scholar 

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

    Google Scholar 

  19. Schneider, H.J.: Syntax-Directed Description of Incremental Compilers, Springer Lect. Notes in Comp. Sci. 26, 1974, 192–201

    Google Scholar 

  20. Schneider, H.J.: Conceptual Data Base Description Using Graph Grammars, erscheint in: Proc. Workshop "Graphentheoretische Konzepte in der Informatik", Göttingen, 1976

    Google Scholar 

  21. Schneider, H.J., Ehrig, H.: Grammars on Partial Graphs, Acta Informatica 6, 297–316 (1976), also in Arbeitsberichte Inst. Math. Masch. Datenverarbeitung (Univ. Erlangen-Nürnberg) Bd. 8 (1975) Nr. 1, 64–91

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Technische Universität Berlin, Otto-Suhr-Allee 18 / 20, 1 Berlin 10

    Hartmut Ehrig

Authors
  1. Hartmut Ehrig
    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

Ehrig, H. (1977). Embedding theorems in the algebraic theory of graph grammars. 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_91

Download citation

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

  • 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