Abstract
Edge replacement systems provide a simple mechanism to generate graph languages. They generalize context-free (string) grammars to the case of graphs. This paper summarizes some recent results on graph languages generated by edge replacement. Especially, we show that our languages are fixed points of their productions (considered as equations) and that they can be generated by language operations (substitution and iteration) from finite graph 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
Bird, R.: Programs and Machines, Wiley, New York (1976).
Claus, V., Ehrig, H., Rozenberg, G. (eds.): Graph-Grammars and their Application to Computer Science and Biology, Lect. Not. Comp. Sci.73 (1979)
Della Vigna, P., Ghezzi, C.: Context-free Graph Grammars, Inf.Contr. 37, 207–233 (1978)
Ehrig, H.: Introduction to the Algebraic Theory of Graph Grammars, Lect. Not. Comp. Sci. 73 (1979), 1–69
Farrow, R., Kennedy, K., Zucconi, L.: Graph Grammars and Global Program Data Flow Analysis; Proc. 17th Ann. Symp. on Found. of Comp. Sci., Houston (1976)
Ginsburg, S., Rice, G.: Two Families of Languages Related to ALGOL, Journ. ACM, vol. 9, 350–371 (1962)
Gruska, J.: A Characterization of Context-free Languages, Journ. Comp. Syst. Sci. 5, 353–364 (1971)
Janssens, D., Rozenberg, G.: On the structure of node-label-controlled graph grammars; Information Science 20, 191–216 (1980)
Kaul, M.: Private Communication, 1982
Kleene, S.C.: Introduction to Meta Mathematics, D. Von Nostrand, Inc., Princeton, N.J. (1952)
Kreowski, H.-J.: Manipulationen von Graphmanipulationen, Ph.D.Thesis, Techn. Univ. Berlin, Comp. Sci. Dept., 1977 (short version in LNCS 56 (1977), 275–286)
-: A Pumping Lemma for Context-free Graph Languages, Lect. Not. Comp. Sci. 73, (1979), 270–283
Manna, Z.: Mathematical Theory of Computation; McGraw-Hill, New York (1974)
Nagl, M.: A Tutorial and Bibliographical Survey on Graph Grammars, Lect. Not. Comp. Sci. 73 (1979), 70–126
Woods, W.A.: Transition Network Grammars for Natural Language Analysis, Comm. of the ACM 1970, 13(10), 591–606
Yntema, M.K.: Cap Expressions for Context-Free Languages, Inf. Contr. 18 (1971), 311–318
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Habel, A., Kreowski, H.J. (1983). On context-free graph languages generated by edge replacement. In: Ehrig, H., Nagl, M., Rozenberg, G. (eds) Graph-Grammars and Their Application to Computer Science. Graph Grammars 1982. Lecture Notes in Computer Science, vol 153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000104
Download citation
DOI: https://doi.org/10.1007/BFb0000104
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12310-1
Online ISBN: 978-3-540-39897-4
eBook Packages: Springer Book Archive