An introduction to the NLC way of rewriting graphs
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.
Unable to display preview. Download preview PDF.
- [ELR]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.Google Scholar
- [GJRT]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.Google Scholar
- [JR6]Janssens, D., and Rozenberg, G., Neighbourhood-Uniform NLC Grammars, Computer Vision, Graphics, and Image Processing, v. 35, 131–151, 1986.Google Scholar
- [RM]Rosenfeld, A., and Milgram, D.L., Web automata and web grammars, Machine Intelligence, v. 7, 307–324, 1972.Google Scholar
- [W]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.Google Scholar