Abstract
We introduce a hypergraph-generating system, called HRNCE grammars, which is structurally simple and descriptively powerful, and present their basic properties, in particular their description power and normal forms.
Preview
Unable to display preview. Download preview PDF.
References
IJ. J. Aalbersberg, J. Engelfriet and G. Rozenberg, The complexity of regular DNLC graph languages, J. Comput. System Sci. 40 (1990), 376–404.
M. Bauderon and B. Courcelle, Graph expressions and graph rewritings, Math. Systems Theory 20 (1987), 83–127.
B. Courcelle, An axiomatic definition of context-free rewriting and its application to NLC graph grammars, Theoret. Comput. Sci. 55 (1987), 141–181.
B. Courcelle, J. Engelfriet and G. Rozenberg, Handle-rewriting hypergraph grammars, J. Comput. System Sci. 46 (1993), 218–270.
J. Engelfriet and L. Heyker, Hypergraph languages of bounded degree, J. Comput. System Sci. 48 (1994), 58–89.
J. Engelfriet and G. Leih, Linear graph grammars: power and complexity, Inform. and Comput. 81 (1989), 88–121.
J. Engelfriet and G. Leih, Complexity of boundary graph languages, Theoretical Informatics and Applications 24 (1990), 267–274.
J. Engelfriet, G. Leih and E. Welzl, Boundary graph grammars with dynamic edge relabeling, J. Comput. System Sci. 40 (1990), 307–345.
J. Engelfriet and G. Rozenberg, A comparison of boundary graph grammars and context-free hypergraph grammars, Inform. and Comput. 84 (1990), 163–206.
A. Habel and H.-J. Kreowski, Some structural aspects of hypergraph languages generated by hyperedge replacement, Proc. STACS 87, Lecture Notes in Computer Science 247 (1987), 207–219.
D. Janssens and G. Rozenberg, On the structure of node-label-controlled graph languages, Inform. Sci. 20 (1980), 191–216.
D. Janssens and G. Rozenberg, Restrictions, extensions, and variations of NLC grammars, Inform. Sci. 20 (1980), 217–244.
C. Lautemann, The complexity of graph languages generated by hyperedge replacement, Acta Inform. 27 (1990), 399–421.
G. Rozenberg and E. Welzl, Boundary NLC graph grammars — Basic definitions, normal forms, and complexity, Inform. and Control 69 (1986), 136–167.
Gy. Turán, On the complexity of graph grammars, Acta Cybernet. 6 (1983), 271–280.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, C., Jeong, T.E. (1996). HRNCE grammars — A hypergraph generating system with an eNCE way of rewriting. In: Cuny, J., Ehrig, H., Engels, G., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1994. Lecture Notes in Computer Science, vol 1073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61228-9_100
Download citation
DOI: https://doi.org/10.1007/3-540-61228-9_100
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61228-5
Online ISBN: 978-3-540-68388-9
eBook Packages: Springer Book Archive