Skip to main content
SpringerLink
Log in

Hyperedge Substitution in Basic Atom-Replacement Languages

  • Conference paper
  • First Online:
Graph Transformation (ICGT 2002)

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

Included in the following conference series:

Abstract

We introduce basic atom replacement in hypergraphs, which allows us to combine node-rewriting steps and hyperedge-rewriting steps within one type of grammar. The generated languages are closed under hyperedge substitution, thereby providing a structured way to build complex hypergraph languages from simple ones. In particular, there are basic atom-replacement languages which cannot be generated by any type of context-free hypergraph grammar.

This research was partially supported by the EC TMR Network GETGRATS (General Theory of Graph Transformation Systems) and the ESPRIT Basic Research Working Group APPLIGRAPH (Applications of Graph Transformation).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Y. Bar-Hillel, M. Perles, and E. Shamir. On formal properties of simple phrase structure grammars. Zeitschrift für Phonetik, Sprachwissenschaft und Kommunikationsforschung, 14:143–177, 1961.

    MATH  MathSciNet  Google Scholar 

  2. Bruno Courcelle, Joost Engelfriet, and Grzegorz Rozenberg. Handle-rewriting hypergraph grammars. Journal of Computer and System Sciences, 46:218–270, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  3. Bruno Courcelle. An axiomatic definition of context-free rewriting and its application to NLC graph grammars. Theoretical Computer Science, 55:141–181, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  4. Frank Drewes, Annegret Habel, and Hans-Jörg Kreowski. Hyperedge replacement graph grammars. In G. Rozenberg, editor, Handbook of Graph Grammars and Computing by Graph Transformation. Vol. I: Foundations, chapter 2, pages 95–162. World Scientific, 1997.

    Google Scholar 

  5. Joost Engelfriet. Context-free graph grammars. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages. Vol. III: Beyond Words, chapter 3, pages 125–213. Springer, 1997.

    Google Scholar 

  6. Joost Engelfriet and Grzegorz Rozenberg. Node replacement graph grammars. In G. Rozenberg, editor, Handbook of Graph Grammars and Computing by Graph Transformation. Vol. I: Foundations, chapter 1, pages 1–94. World Scientific, 1997.

    Google Scholar 

  7. Annegret Habel. Hyperedge Replacement: Grammars and Languages, volume 643 of Lecture Notes in Computer Science. Springer, 1992.

    MATH  Google Scholar 

  8. Renate Klempien-Hinrichs. Node replacement in hypergraphs: Simulation of hyperedge replacement, and decidability of confluence. In J. Cuny, H. Ehrig, G. Engels, and G. Rozenberg, editors, Proc. Fifth Intl. Workshop on Graph Grammars and Their Application to Comp. Sci., volume 1073 of Lecture Notes in Computer Science, pages 397–411. Springer, 1996.

    Chapter  Google Scholar 

  9. Renate Klempien-Hinrichs. The generative power of context-free node rewriting in hypergraphs. Grammars, 2:211–221, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  10. Renate Klempien-Hinrichs. Context-free Hypergraph Grammars. Node and Hyperedge Rewriting with an Application to Petri Nets. Books on Demand, Norderstedt, 2001. Doctoral thesis, Universität Bremen, 2000.

    Google Scholar 

  11. Rohit J. Parikh. On context-free languages. Journal of the Association for Computing Machinery, 13:570–581, 1966.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik/Informatik, Universität Bremen, Postfach 33 0440, D-28334, Bremen, Germany

    Renate Klempien-Hinrichs

Authors
  1. Renate Klempien-Hinrichs
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Corso Italia 40, 56125, Pisa, Italy

    Andrea Corradini

  2. Computer Science Department, Technical University of Berlin, Franklinstraße 28/29, 10587, Berlin, Germany

    Hartmut Ehrig

  3. Computer Science Department, University of Bremen, Bibliothekstraße 1, 28359, Bremen, Germany

    Hans -Jörg Kreowski

  4. Leiden Institute of Advanced Computer Science, Leiden University, Niels Bohrweg 1, 2333, CA Leiden, The Netherlands

    Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Klempien-Hinrichs, R. (2002). Hyperedge Substitution in Basic Atom-Replacement Languages. In: Corradini, A., Ehrig, H., Kreowski, H.J., Rozenberg, G. (eds) Graph Transformation. ICGT 2002. Lecture Notes in Computer Science, vol 2505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45832-8_16

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44310-0

  • Online ISBN: 978-3-540-45832-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation