Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Anderson: Graph Theory and Finite Combinatorics, Markham, Chicago 1970
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, 1961
M. Bauderon, B. Courcelle: Graph Expressions and Graph Rewriting, Comp. Sci. Research Report no. 8525, University of Bordeaux, 1985
H. Bunke: Graph Grammars as a Generative Tool in Image Understanding, Lect. Not. Comp. Sci. 153, 8–19, 1983
M. de Does, A. Lindenmayer: Algorithms for the Generation and Drawing of Maps Representing Cell Clones, Lect. Not. Comp. Sci. 153, 39–58, 1983
J. Feder: Languages of Encoded Line Patterns, Inform. Contr. 13, 230–244, 1968
J. Feder: Plex Languages, Inform. Sci. 3, 225–241, 1971
K.S. Fu: Syntactic Methods in Pattern Recognition, Academic Press, New York, 1974
D. Gans: Transformations and Geometries, Appleton-Century-Crofts, New York, 1969
S. Ginsburg, G. Rice: Two Families of Languages Related to ALGOL, Journ. ACM 9, 350–371, 1962
A. Habel, H.-J. Kreowski: On Context-Free Graph Languages Generated by Edge Replacement, Lect. Not. Comp. Sci. 153, 143–158, 1983
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, 1987
A. Habel, H.-J. Kreowski: Some Structural Aspects of Hypergraph Languages Generated by Hyperedge Replacement, Lect. Not. Comp. Sci. 247, 207–219, 1987
G.T. Herman, G. Rozenberg: Development Systems and Languages, North Holland/American Elsevier 1975
J.E. Hopcroft, J.D. Ullmann: Formal Languages and Their Relation to Automata, Addison-Wesley, 1969
H.-J. Kreowski: Manipulationen von Graphmanipulationen, Ph. D. Thesis, Techn. Univ. Berlin, Comp. Sci. Dept., 1977
H.-J. Kreowski: A Pumping Lemma for Context-Free Graph Languages, Lect. Not. Comp. Sci. 73, 270–283, 1979
B.B. Mandelbrot: Fractals, Freeman, San Francisco, 1977
J.L. Pfaltz, A. Rosenfeld: Web Grammars, Proc. Int. Joint Conf. Art. Intelligence, 609–619, 1969
P. Prusinkiewicz: Graphical Applications of L-Systems, Proc. of Graphics Interface '86 — Vision Interface '86, 247–253, 1986
A.C. Shaw: A Formal Description Schema as a Basis for Picture Processing Systems, Inf. Contr. 14, 9–52, 1969
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Habel, A., Kreowski, HJ. (1988). Pretty patterns produced by hyperedge replacement. In: Göttler, H., Schneider, HJ. (eds) Graph-Theoretic Concepts in Computer Science. WG 1987. Lecture Notes in Computer Science, vol 314. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19422-3_3
Download citation
DOI: https://doi.org/10.1007/3-540-19422-3_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19422-4
Online ISBN: 978-3-540-39264-4
eBook Packages: Springer Book Archive