Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Fundamentals of Computation Theory

FCT 1993: Fundamentals of Computation Theory pp 69–86Cite as

Five facets of hyperedge replacement beyond context-freeness

  • Invited Lectures
  • Conference paper
  • First Online:

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

Abstract

Hyperedge replacement has been studied for more than twenty years as a rulebased device for the generation of sets of graphs, hypergraphs and other graphlike structures. By now, it is one of the best understood and developed branches of the theory of graph grammars providing mainly a graph-grammatical counterpart to context-free Chomsky grammars. But there is more to it than just context-freeness. Hyperedge replacement has got some other facets to overcome — at least to a certain degree — the restricted generative power and applicability:

  1. 1.

    parallel hyperedge replacement with a mode of rewriting like OL- and TOL-systems,

  2. 2.

    hyperedge replacement with rendezvous,

  3. 3.

    hyperedge replacement with required or forbidden context,

  4. 4.

    hyperedge replacement with rule-selection specifications like path expressions,

  5. 5.

    infinite hyperedge replacement generating potentially infinite graphs.

In this paper these five facets of hyperedge replacement beyond context-freeness, the first two of which are already known in the literature, are introduced, discussed, investigated and related to each other and to other frameworks.

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. M. Bauderon: General solution to a system of recursive equations on hypergraphs. Lecture Notes in Computer Science 532, 113–126, 1991.

    Google Scholar 

  2. M. Bauderon, B. Courcelle: Graph expressions and graph rewriting. Mathematical Systems Theory 20, 83–127, 1987.

    Article  Google Scholar 

  3. E.F. Codd: Cellular Automata. Academic Press, 1968.

    Google Scholar 

  4. B. Courcelle: On context-free sets of graphs and their monadic second-order theory. Lecture Notes in Computer Science 291, 133–146, 1987.

    Google Scholar 

  5. B. Courcelle: A representation of graphs by algebraic expressions and its use for graph rewriting systems. Lecture Notes in Computer Science 291, 112–132, 1987.

    Google Scholar 

  6. B. Courcelle: The monadic second-order logic of graphs, III: treewidth, forbidden minors and complexity issues. Preprint, Université Bordeaux 1, 1988.

    Google Scholar 

  7. G. David, F. Drewes, H.-J. Kreowski: Hyperedge replacement with rendezvous. Lectures Notes in Computer Science 668, 167–181, 1993.

    Google Scholar 

  8. J. Feder: Plex languages. Information Science 3, 225–241, 1971.

    Google Scholar 

  9. A. Habel: Hyperedge Replacement: Grammars and Languages. Lecture Notes in Computer Science 643, 1992.

    Google Scholar 

  10. A. Habel, H.-J. Kreowski: Characteristics of graph languages generated by edge replacement. Theoretical Computer Science 51, 81–115, 1987.

    Article  Google Scholar 

  11. A. Habel, H.-J. Kreowski: May we introduce to you: hyperedge replacement. Lecture Notes in Computer Science 291, 15–26, 1987.

    Google Scholar 

  12. A. Habel, H.-J. Kreowski: Some structural aspects of hypergraph languages generated by hyperedge replacement. Lecture Notes in Computer Science 247, 207–219, 1987.

    Google Scholar 

  13. A. Habel, H.-J. Kreowski, C. Lautemann: A Comparison of Compatible, Finite, and Inductive Graph Properties. Theoretical Computer Science 110, 145–168, 1993.

    Article  Google Scholar 

  14. A. Habel, H.-J. Kreowski, W. Vogler: Decidable boundedness problems for hyperedge replacement graph grammars. Lecture Notes in Computer Science 351, 275–289, 1989. Proc. TAPSOFT 89.

    Google Scholar 

  15. A. Habel, H.-J. Kreowski, W. Vogler: Metatheorems for decision problems on hyperedge replacement graph languages. Acta Informatica 26, 657–677, 1989.

    Article  Google Scholar 

  16. H.-J. Kreowski: A pumping lemma for context-free graph languages. Lecture Notes in Computer Science 73, 270–283, 1979.

    Google Scholar 

  17. H.-J. Kreowski: Parallel hyperedge replacement. In: G. Rozenberg, A. Salomaa (eds.): Lindenmayer Systems. Springer Verlag, Berlin-Heidelberg-New York 271–282, 1992.

    Google Scholar 

  18. C. Lautemann: The complexity of graph languages generated by hyperedge replacement. Acta Informatica 27, 399–421, 1990.

    Article  Google Scholar 

  19. T. Lengauer, E. Wanke: Efficient analysis of graph properties on context-free graph languages. Lecture Notes in Computer Science 317, 379–393, 1988.

    Google Scholar 

  20. T. Pavlidis: Linear and context-free graph grammars. Journal of the ACM 19(1), 11–23, 1972.

    Article  Google Scholar 

  21. G. Rozenberg, A. Salomaa: The Mathematical Theory of L Systems. Academic Press, New York 1980.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Hans -Jörg Kreowski

Authors
  1. Hans -Jörg Kreowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Zoltán Ésik

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kreowski, H.J. (1993). Five facets of hyperedge replacement beyond context-freeness. In: Ésik, Z. (eds) Fundamentals of Computation Theory. FCT 1993. Lecture Notes in Computer Science, vol 710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57163-9_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-57163-9_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47923-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation