Skip to main content
SpringerLink
Log in

Closure properties of context-free Hyperedge Replacement Systems

  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 1996)

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

Included in the following conference series:

  • 150 Accesses

Abstract

Hyperedge replacement systems are investigated in terms of closure properties with respect to language operators such as union, intersection and concatenation. It is shown that context-free HR systems are closed under union, coalesced sum and concatenation but not under intersection, giving an explicit counterexample.

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. Courcelle, B.: Graph Rewriting: an algebraic and logical approach. Handbook of Theoret.Comp.Sci. vol.B, Elsevier 1990, 193–242

    Google Scholar 

  2. Ehrig, H.: Introduction to the Algebraic Theory of Graph Grammars. Springer Lect. Notes Comp. Sci. 73 (1979) 1–69

    Google Scholar 

  3. Engelfriet, J., Vereijken, J.J.: Concatenation of Graphs. partecipant edition of Proceedings of Fifth Internat.Wksp on Graph Grammars and their applications to Comp.Sci., USA nov 1994, 13–18

    Google Scholar 

  4. Golin, E.J., Reiss, S.P.: The Specification of Visual Language Syntax. Proc. IEEE Workshop on Visual Languages, Rome (Italy) (1989) 105–110

    Google Scholar 

  5. Habel,A.: Hyperedge Replacement: Grammars and Languages. Springer Lect. Notes Comp. Sci. 643 (1992)

    Google Scholar 

  6. Helm, R., Marriot, K.: Declarative Specification of Visual Languages. Proc. IEEE Workshop on Visual Languages, Skokie (Illinois, USA) (1990) 98–103

    Google Scholar 

  7. Nagl, M.: A tutorial and bibliographical survey on Graph Grammars. Springer Lect. Notes Comp. Sci. 73 (1979) 70–126

    Google Scholar 

  8. Nagl, M.: Formal languages of labelled graphs. Computing 16 (1976) 113–137

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Scienze dell'Informazione, Universita' di Roma ’La Sapienza’, 00198, Roma, Italy

    Ornella Ciotti & Francesco Parisi-Presicce

Authors
  1. Ornella Ciotti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Francesco Parisi-Presicce
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Fabrizio d'Amore Paolo Giulio Franciosa Alberto Marchetti-Spaccamela

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ciotti, O., Parisi-Presicce, F. (1997). Closure properties of context-free Hyperedge Replacement Systems. In: d'Amore, F., Franciosa, P.G., Marchetti-Spaccamela, A. (eds) Graph-Theoretic Concepts in Computer Science. WG 1996. Lecture Notes in Computer Science, vol 1197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62559-3_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-62559-3_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62559-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation