Abstract
Apex graph grammars are NLC-like graph grammars with the restriction that embedding edges are established between terminal nodes only. Some basic theoretical properties of these grammars are investigated.
Key words
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
J. Berstel; "Transductions and context-free languages", Teubner, Stuttgart, 1979.
J.Engelfriet, G.Leih, G.Rozenberg; Apex graph grammars and attribute grammars; Report 87-04, Institute of Applied Math. and Computer Science, University of Leiden, March 1987.
F. Gecseg, M. Steinby; "Tree automata", Akademiai Kiado, Budapest, 1984.
S. Ginsburg, E. Spanier; Derivation-bounded languages, JCSS 2 (1968), 228–250.
E.M. Gurari, I.H. Sudborough; Improved dynamic programming algorithms for bandwidth minimization and the min-cut linear arrangement problem, J. of Algorithms 5 (1984), 531–546.
D. Janssens, G. Rozenberg; Restrictions, extensions, and variations of NLC grammars, Information Sciences 20 (1980), 217–244.
D. Janssens, G. Rozenberg; Graph grammars with neighbourhood-controlled embedding, Theor.Comp.Science 21 (1982), 55–74.
D. Janssens, G. Rozenberg, R. Verraedt; On sequential and parallel node-rewriting graph grammars, Computer Graphics and Image Processing 18 (1982), 279–304.
M.Kaul; Syntaxanalyse von Graphen bei Präzedenz-Graph-Grammatiken, Dissertation, Universität Osnabrück, 1985.
T. Lengauer; Upper and lower bounds on the complexity of the min-cut linear arrangement problem on trees, SIAM J. Alg. Disc. Meth. 3 (1982), 99–113.
M. Nagl; "Graph-Grammatiken", Vieweg, Braunschweig, 1979.
G. Rozenberg, E. Welzl; Boundary NLC graph grammars — basic definitions, normal forms, and complexity, Inform. Contr. 69 (1986), 136–167.
E. Welzl; Encoding graphs by derivations and implications for the theory of graph grammars, Proc. 11th ICALP, Lecture Notes in Computer Science 172, Springer-Verlag, Berlin, 1984, pp.503–513.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Engelfriet, J., Leih, G., Rozenberg, G. (1987). Apex graph grammars. 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_52
Download citation
DOI: https://doi.org/10.1007/3-540-18771-5_52
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