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).
Cite
CITATION STYLE
Engelfriet, J., & Vereijken, J. J. (1996). Concatenation of graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1073, pp. 368–382). Springer Verlag. https://doi.org/10.1007/3-540-61228-9_99
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
