Abstract
This paper presents an introduction to the rewriting mechanism of Node-Label Controlled (NLC) graph grammars. First we present a more general framework (LEARRE graph grammars) from which NLC graph grammars are obtained through a number of restrictions. The paper is of a tutorial character with the stress on the intuitive (illustrated by examples) explanation of concepts rather than on the formalism.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
4. References
Engelfriet, J., Leih, G., and Rozenberg, G., Apex graph grammars and attribute grammars, Dept. of Computer Science, University of Leiden, Techn. Report 87–04, 1987.
Ehrenfeucht, A., Main, M., and Rozenberg, G., Restrictions on NLC graph grammars, Theoretical Computer Science, v. 31, 211–223, 1984.
Genrich, H.J., Janssens, D., Rozenberg G., and Thiagarajan, P.S., Generalized handle grammars and their relation to Petri nets, Journal of Information Processing and Cybernetics — EIK, v. 4, 179–206, 1984.
Janssens, D., and Rozenberg G., On the structure of node-label controlled graph languages, Information Sciences, v. 20, 191–216, 1980.
Janssens, D., and Rozenberg, G., Restrictions extensions and variations of NLC grammars, Information Sciences, v. 20, 217–244, 1980.
Jansens, D., and Rozeberg G., Decision problems for node-label controlled graph grammars, Journal of Computer and System Sciences, v. 22, 144–177, 1981.
Janssens, D., and Rozenberg, G., A characterization of context-free string languages by directed node-label controlled graph grammars, Acta Informatica, v. 16, 63–85, 1981.
Janssens, D., and Rozenberg, G., Graph grammars with neighbourhood controlled embedding, Theoretical Computer Science, v. 21, 55–74, 1982.
Janssens, D., and Rozenberg, G., Neighbourhood-Uniform NLC Grammars, Computer Vision, Graphics, and Image Processing, v. 35, 131–151, 1986.
Janssens, D., Rozenberg, G., and Verraedt, R., On sequential and parallel node-rewriting graph grammars, Computer Graphics and Image Processing, v. 18, 279–304, 1982.
Rosenfeld, A., and Milgram, D.L., Web automata and web grammars, Machine Intelligence, v. 7, 307–324, 1972.
Rozenberg, G., and Welzl, E., Boundary NLC graph grammars — basic definitions, normal forms, and complexity, Information and Control, v. 69, 136–167, 1986.
Rozenberg, G., and Welzl, E., Graph theoretic closure properties of the family of boundary NLC languages, Acta Informatica, v. 23, 289–309, 1986.
Rozenberg, G., and Welzl, E., Combinatorial properties of boundary NLC graph languages, Discrete Applied Mathematics, v. 16, 59–73, 1987.
Welzl, E., On the set of all subgraphs of the graphs in a boundary NLC graph language, in The Book of L (Rozenberg, G., and Salomaa, A., eds.), Springer Verlag, Berlin, Heidelberg, 445–459, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rozenberg, G. (1987). An introduction to the NLC way of rewriting graphs. In: Ehrig, H., Nagl, M., Rozenberg, G., Rosenfeld, A. (eds) Graph-Grammars and Their Application to Computer Science. Graph Grammars 1986. Lecture Notes in Computer Science, vol 291. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18771-5_44
Download citation
DOI: https://doi.org/10.1007/3-540-18771-5_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18771-4
Online ISBN: 978-3-540-48178-2
eBook Packages: Springer Book Archive