Skip to main content

Generating graph languages using hypergraph grammars

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1981)

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

Included in the following conference series:

  • 160 Accesses

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Nagl, Graph-Grammatiken: Theorie, Anwendungen, Implementierung, Vieweg-Verlag, Wiesbaden, 1979.

    Google Scholar 

  2. V. Claus, H. Ehrig, G. Rozenberg, Graph Grammars and their applications to Computer Science and Biology, Springer-Verlag, Lecture Notes in Computer Science vol. 73, Berlin-Heidelberg-New York, 1979.

    Google Scholar 

  3. H. Ehrig, Introduction to the algebraic theory of graph grammars, 1–69, in [CER].

    Google Scholar 

  4. M. Nagl, A tutorial and bibliographical survey on graph grammars, 70–126, in [CER].

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Ferenc Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Janssens, D., Rozenberg, G. (1981). Generating graph languages using hypergraph grammars. In: Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1981. Lecture Notes in Computer Science, vol 117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10854-8_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-10854-8_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10854-2

  • Online ISBN: 978-3-540-38765-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics