Abstract
A new mechanism for generating graph languages is introduced which is based on the controlled rewriting of graphs using only six elementary types of graph productions, namely the addition, the deletion and the renaming of a node or an edge. Although these elementary graph productions are acting strictly locally and no embedding transformations are needed, in the unrestricted and monotone case, elementary programmed graph grammars have the same generative power as expression graph grammars. As a graph with attributes assigned to its nodes and edges is an even more useful tool for the description of certain data structures than a directed graph, attributed elementary programmed graph grammars turn out to be adequate graph rewriting systems applicable in many areas of computer science.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
: Bunke, Horst: On the Generative Power of Sequential and Parallel Programmed Graph Grammars. Computing 29, 89–112, 1982.
: Dassow, Jürgen, PĂun, Gheorghe: Regulated Rewriting in Formal Language Theory. Springer-Verlag, Berlin, New York, 1989.
: Engels, Gregor, Lewerentz, Claus, Schäfer, Wilhelm: Graph Grammar Engineering: A Software Specification Method. In: [LNCS 291], 186–291.
: Freund, Rudolf: Elementary Programmed Graph Grammars, Technical report 185/2/F/GG1/91, Technical University of Vienna, 1991.
: Göttler, Herbert: Attributed Graph Grammars for Graphics. In: [LNCS 153], 130–142.
: Haberstroh, Brigitte: Analyse programm für elementare programmierte Graphgrammatiken. Report 180/3/H/GG2/90, Technical University of Vienna, 1990.
: Haberstroh, Brigitte, Freund, Rudolf:, Describing Neural Networks by Using Attributed Elementary Programmed Graph Grammars. To be presented at the Workshop Connectionism of the Seventh Austrian Conference on Artificial Intelligence 1991.
: Hopcroft, John E., Ullman, Jeffrey D.: Introductionto Automata Theory, Languages and Computation. Addison-Wesley Publishing Company, Reading Massachussetts, 1979.
: Kaplan, Simon M., Goering, Steven K., Campbell, Ray H.: Supporting the Software Development Process with Attributed NLC Graph Grammars. In: [LNCS 291], 309–325.
: Lecture Notes in Computer Science, Vol.153: Graph Grammars and Their Application to Computer Science. Springer-Verlag, Berlin, New York, 1983.
: Lecture Notes in Computer Science, Vol. 291: Graph Grammars and Their Application to Computer Science. Springer-Verlag, Berlin, New York, 1987.
: Nagl, Manfred: Formal Languages of Labelled Graphs. Computing 16, 113–137, 1976.
: Salomaa, A.: Formal Languages. Academic Press, New York, London, 1973.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Freund, R., Haberstroh, B. (1992). Attributed elementary programmed graph grammars. In: Schmidt, G., Berghammer, R. (eds) Graph-Theoretic Concepts in Computer Science. WG 1991. Lecture Notes in Computer Science, vol 570. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55121-2_7
Download citation
DOI: https://doi.org/10.1007/3-540-55121-2_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55121-8
Online ISBN: 978-3-540-46735-9
eBook Packages: Springer Book Archive