Abstract
An operation of concatenation is defined for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a class K of string languages, Int(K) is the class of all graph languages that are interpretations of languages from K. For the class REG of regular languages, Int(REG) might be called the class of regular graph languages; it equals the class of graph languages generated by linear Hyperedge Replacement Systems. Two characterizations are given of the largest class K′ such that Int(K′)=Int(K).
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M.Bauderon, B.Courcelle; Graph expressions and graph rewritings, Math. Syst. Theory 20 (1987), 83–127
D.B.Benson; The basic algebraic structures in categories of derivations, Inf. and Control 28 (1975), 1–29
J. Berstel; Transductions and Context-Free Languages, Teubner, Stuttgart, 1979
F.Bossut, M.Dauchet, B.Warin; A Kleene theorem for a class of planar acyclic graphs, Inf. and Comp. 117 (1995), 251–265
V.Claus; Ein Vollständigkeitssatz für Programme und Schaltkreise, Acta Informatica 1 (1971), 64–78
B.Courcelle; Graph rewriting: an algebraic and logic approach, in Handbook of Theoretical Computer Science, Vol.B (J.van Leeuwen, ed.), Elsevier, 1990, pp.193–242
B.Courcelle, J.Engelfriet, G.Rozenberg; Handle-rewriting hypergraph languages, J. of Comp. Syst. Sci. 46 (1993), 218–270
F.Drewes; Transducibility — symbolic computation by tree-transductions, University of Bremen, Bericht Nr. 2/93, 1993
H. Ehrig, K.-D. Kiermeier, H.-J. Kreowski, W. Kühnel; Universal Theory of Automata, Teubner, Stuttgart, 1974
J.Engelfriet; Graph grammars and tree transducers, Proc. CAAP'94 (S.Tison, ed.), Lecture Notes in Computer Science 787, Springer-Verlag, Berlin, 1994, pp.15–36
J.Engelfriet, L.M.Heyker; The string generating power of context-free hypergraph grammars, J. of Comp. Syst. Sci. 43 (1991), 328–360
J.Engelfriet, L.M.Heyker, G.Leih; Context-free graph languages of bounded degree are generated by apex graph grammars, Acta Informatica 31 (1994), 341–378
J.Engelfriet, G.Rozenberg, G.Slutzki; Tree transducers, L systems, and two-way machines, J. of Comp. Syst. Sci. 20 (1980), 150–202
J.Engelfriet, J.J.Vereijken; Context-free graph grammars and concatenation of graphs, Report 95-27, Leiden University, September 1995
F.Gécseg, M.Steinby; Tree Automata, Akadémiai Kiadó, Budapest, 1984
S.Greibach; One-way finite visit automata, Theor. Comput. Sci. 6 (1978), 175–221
A.Habel; Hyperedge Replacement: Grammars and Languages, Lecture Notes in Computer Science 643, Springer-Verlag, Berlin, 1992
G.Hotz; Eine Algebraisierung des Syntheseproblems von Schaltkreisen, EIK 1 (1965), 185–205, 209–231
G.Hotz; Eindeutigkeit und Mehrdeutigkeit formaler Sprachen, EIK 2 (1966), 235–246
G.Hotz, R.Kolla, P.Molitor; On network algebras and recursive equations, in Graph-Grammars and Their Application to Computer Science (H.Ehrig, M.Nagl, G.Rozenberg, A.Rosenfeld, eds.), Lecture Notes in Computer Science 291, Springer-Verlag, Berlin, 1987, pp.250–261
V.Rajlich; Absolutely parallel grammars and two-way finite state transducers, J. of Comp. Syst. Sci. 6 (1972), 324–342
A.Salomaa; Formal Languages, Academic Press, New York, 1973
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Engelfriet, J., Vereijken, J.J. (1996). Concatenation of graphs. In: Cuny, J., Ehrig, H., Engels, G., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1994. Lecture Notes in Computer Science, vol 1073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61228-9_99
Download citation
DOI: https://doi.org/10.1007/3-540-61228-9_99
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61228-5
Online ISBN: 978-3-540-68388-9
eBook Packages: Springer Book Archive