Abstract
An elementary introduction to the notion of an NLC graph grammar is given, and several of its extensions and variations are discussed in a systematic way. Simple concepts are considered rather than technical details.
Keywords
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
IJ.J. Aalbersberg, J. Engelfriet, G. Rozenberg; The complexity of regular DNLC graph languages, JCSS 40 (1990), 376–404
IJ.J. Aalbersberg, G. Rozenberg; Traces, dependency graphs and DNLC grammars, Discrete Appl. Math. 11 (1985), 299–306
IJ.J. Aalbersberg, G. Rozenberg, A. Ehrenfeucht; On the membership problem for regular DNLC grammars, Discrete Appl. Math. 13 (1986), 79–85
F.J. Brandenburg; On partially ordered graph grammars, in 99–111
F.J.Brandenburg; On polynomial time graph grammars, Proc. STACS 88, Lecture Notes in Computer Science 294, Springer-verlag, Berlin, 227–236
B. Courcelle; An axiomatic definition of context-free rewriting and its application to NLC graph grammars, Theor. Comput. Sci. 55 (1987), 141–181
B.Courcelle, J.Engelfriet, G.Rozenberg; Context-free handle-rewriting hypergraph grammars, this Volume
A. Ehrenfeucht, M.G. Main, G. Rozenberg; Restrictions on NLC graph grammars, Theor. Comput. Sci. 31 (1984), 211–223
H.Ehrig, D.Janssens, H.-J.Kreowski, G.Rozenberg; Concurrency of node-label controlled graph transformations, Report 82-38, University of Antwerp, U.I.A., 1982
H. Ehrig, M. Nagl, G. Rozenberg, A. Rosenfeld (eds.); "Graph-Grammars and their Application to Computer Science", Lecture Notes in Computer Science 291, Springer-Verlag, Berlin, 1987
J. Engelfriet; Context-free NCE graph grammars, Proc. FCT '89, Lecture Notes in Computer Science 380, Springer-Verlag, Berlin, 1989, 148–161
J.Engelfriet; A characterization of context-free NCE graph languages by monadic second-order logic on trees, this Volume
J. Engelfriet, G. Leih; Nonterminal bounded NLC graph grammars, Theor. Comput. Sci. 59 (1988), 309–315
J. Engelfriet, G. Leih; Linear graph grammars: power and complexity, Inform. and Comput. 81 (1989), 88–121
J. Engelfriet, G. Leih; Complexity of boundary graph languages, RAIRO Theoretical Informatics and Applications 24 (1990), 267–274
J. Engelfriet, G. Leih, G. Rozenberg; Apex graph grammars and attribute grammars, Acta Informatica 25 (1988), 537–571
J.Engelfriet, G.Leih, G.Rozenberg; Nonterminal separation in graph grammars, Report 88-29, Leiden University; to appear in Theor. Comput. Sci.
J. Engelfriet, G. Leih, E. Welzl; Boundary graph grammars with dynamic edge relabeling, JCSS 40 (1990), 307–345
J. Engelfriet, G. Rozenberg; A comparison of boundary graph grammars and context-free hypergraph grammars, Inform. and Comput. 84 (1990), 163–206
H.J. Genrich, D. Janssens, G. Rozenberg, P.S. Thiagarajan; Generalized handle grammars and their relation to Petri nets, EIK 4 (1984), 179–206
J. Hoffmann, M.G. Main; Results on NLC grammars with one-letter terminal alphabets, Theor. Comput. Sci. 73 (1990), 279–294
D. Janssens, G. Rozenberg; On the structure of node-label-controlled graph languages, Information Sciences 20 (1980), 191–216
D. Janssens, G. Rozenberg; Restrictions, extensions, and variations of NLC grammars, Information Sciences 20 (1980), 217–244
D. Janssens, G. Rozenberg; Decision problems for node label controlled graph grammars, JCSS 22 (1981), 144–177
D. Janssens, G. Rozenberg; A characterization of context-free string languages by directed node-label controlled graph grammars, Acta Informatica 16 (1981), 63–85
D. Janssens, G. Rozenberg; Graph grammars with neighbourhood-controlled embedding, Theor. Comput. Sci. 21 (1982), 55–74
D. Janssens, G. Rozenberg; Neighborhood-uniform NLC grammars, Computer Vision, Graphics, and Image Processing 35 (1986), 131–151
D. Janssens, G. Rozenberg, R. Verraedt; On sequential and parallel node-rewriting graph grammars, Computer Graphics and Image Processing 18 (1982), 279–304
D. Janssens, G. Rozenberg, E. Welzl; The bounded degree problem for NLC grammars is decidable, JCSS 33 (1986), 415–422
J. Jeffs; Embedding rule independent theory of graph grammars, in 299–308
M.Kaul; "Syntaxanalyse von Graphen bei Präzedenz-Graph-Grammatiken", Dissertation, Universität Osnabrück, 1985
M. Kaul; Practical applications of precedence graph grammars, in 326–342
H.-J. Kreowski, G. Rozenberg; Note on node-rewriting graph grammars, Inf. Proc. Letters 18 (1984), 21–24
M.G. Main, G. Rozenberg; Handle NLC grammars and r.e. languages, JCSS 35 (1987), 192–205
M.G. Main, G. Rozenberg; Edge-label controlled graph grammars, JCSS 40 (1990), 188–228
G. Rozenberg, E. Welzl; Boundary NLC graph grammars — basic definitions, normal forms, and complexity, Inform. and Control 69 (1986), 136–167
G. Rozenberg, E. Welzl; Graph theoretic closure properties of the family of boundary NLC graph languages, Acta Informatica 23 (1986), 289–309
G. Rozenberg, E. Welzl; Combinatorial properties of boundary NLC graph languages, Discrete Appl. Math. 16 (1987), 59–73
R.Schuster; Graphgrammatiken und Grapheinbettungen: Algorithmen und Komplexität, Report MIP-8711, Passau, 1987
W. Vogler; On hyperedge replacement and BNLC graph grammars, in Graph-Theoretic Concepts in Computer Science WG '89, Lecture Notes in Computer Science 411, Springer-Verlag, Berlin, 78–93
E. Welzl; Boundary NLC and partition controlled graph grammars, in 593–609
E. Welzl; On the set of all subgraphs of the graphs in a boundary NLC graph language, in "The Book of L" (G. Rozenberg, A. Salomaa, eds.), Springer-Verlag, Berlin, 1986, 445–459
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Engelfriet, J., Rozenberg, G. (1991). Graph grammars based on node rewriting: an introduction to NLC graph grammars. In: Ehrig, H., Kreowski, HJ., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1990. Lecture Notes in Computer Science, vol 532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017374
Download citation
DOI: https://doi.org/10.1007/BFb0017374
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54478-4
Online ISBN: 978-3-540-38395-6
eBook Packages: Springer Book Archive