Pretty patterns produced by hyperedge replacement

  • Annegret Habel
  • Hans-Jörg Kreowski
Graph-Grammars And Graph-Languages
Part of the Lecture Notes in Computer Science book series (LNCS, volume 314)


Hyperedge replacement grammars provide a simple mechanism for generating graph and hypergraph languages. In this paper, hyperedge replacement grammars are equipped with layout information. Therefore, the generated graphs and hypergraphs can easily be displayed as 2-dimensional (or likewise as 3-dimensional) patterns on a “screen”, which is given by a layout of the initial hypergraph. In this way, the well studied graph grammar approach of edge and hyperedge replacement grammars can be utilized for producing pretty patterns.

This paper summarizes some recent results on languages generated by a pattern-generating hyperedge replacement grammar. In particular, we show that these languages are fixed points of their productions (considered as equations) and that they possess a pumping property similar to the pumping property of context-free string languages.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [An 70]
    S. Anderson: Graph Theory and Finite Combinatorics, Markham, Chicago 1970Google Scholar
  2. [BPS 61]
    Y. Bar-Hillel, M. Perles, E. Shamir: On Formal Properties of Simple Phrase-Structure Grammars, Zeitschrift für Phonetik, Sprachwissenschaft, und Kommunikationsforschung 14, 143–177, 1961Google Scholar
  3. [BC 85]
    M. Bauderon, B. Courcelle: Graph Expressions and Graph Rewriting, Comp. Sci. Research Report no. 8525, University of Bordeaux, 1985Google Scholar
  4. [Bu 83]
    H. Bunke: Graph Grammars as a Generative Tool in Image Understanding, Lect. Not. Comp. Sci. 153, 8–19, 1983Google Scholar
  5. [DL 83]
    M. de Does, A. Lindenmayer: Algorithms for the Generation and Drawing of Maps Representing Cell Clones, Lect. Not. Comp. Sci. 153, 39–58, 1983Google Scholar
  6. [Fe 68]
    J. Feder: Languages of Encoded Line Patterns, Inform. Contr. 13, 230–244, 1968CrossRefGoogle Scholar
  7. [Fe 71]
    J. Feder: Plex Languages, Inform. Sci. 3, 225–241, 1971Google Scholar
  8. [Fu 74]
    K.S. Fu: Syntactic Methods in Pattern Recognition, Academic Press, New York, 1974Google Scholar
  9. [Ga 69]
    D. Gans: Transformations and Geometries, Appleton-Century-Crofts, New York, 1969Google Scholar
  10. [GR 62]
    S. Ginsburg, G. Rice: Two Families of Languages Related to ALGOL, Journ. ACM 9, 350–371, 1962CrossRefGoogle Scholar
  11. [HK 83]
    A. Habel, H.-J. Kreowski: On Context-Free Graph Languages Generated by Edge Replacement, Lect. Not. Comp. Sci. 153, 143–158, 1983Google Scholar
  12. [HK 85]
    A. Habel, H.-J. Kreowski: Characteristics of Graph Languages Generated by Edge Replacement, University of Bremen, Comp. Sci. Report No. 3/85 (1985), also in Theor. Comp. Sci. 51, 81–115, 1987CrossRefGoogle Scholar
  13. [HK 87]
    A. Habel, H.-J. Kreowski: Some Structural Aspects of Hypergraph Languages Generated by Hyperedge Replacement, Lect. Not. Comp. Sci. 247, 207–219, 1987Google Scholar
  14. [HR 75]
    G.T. Herman, G. Rozenberg: Development Systems and Languages, North Holland/American Elsevier 1975Google Scholar
  15. [HU 69]
    J.E. Hopcroft, J.D. Ullmann: Formal Languages and Their Relation to Automata, Addison-Wesley, 1969Google Scholar
  16. [Kr 77]
    H.-J. Kreowski: Manipulationen von Graphmanipulationen, Ph. D. Thesis, Techn. Univ. Berlin, Comp. Sci. Dept., 1977Google Scholar
  17. [Kr 79]
    H.-J. Kreowski: A Pumping Lemma for Context-Free Graph Languages, Lect. Not. Comp. Sci. 73, 270–283, 1979Google Scholar
  18. [Ma 77]
    B.B. Mandelbrot: Fractals, Freeman, San Francisco, 1977Google Scholar
  19. [PR 69]
    J.L. Pfaltz, A. Rosenfeld: Web Grammars, Proc. Int. Joint Conf. Art. Intelligence, 609–619, 1969Google Scholar
  20. [Pr 86]
    P. Prusinkiewicz: Graphical Applications of L-Systems, Proc. of Graphics Interface '86 — Vision Interface '86, 247–253, 1986Google Scholar
  21. [Sh 69]
    A.C. Shaw: A Formal Description Schema as a Basis for Picture Processing Systems, Inf. Contr. 14, 9–52, 1969CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Annegret Habel
    • 1
  • Hans-Jörg Kreowski
    • 1
  1. 1.Fachbereich Mathematik und InformatikUniversität BremenBremen

Personalised recommendations