Apex graph grammars

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 291 LNCS, Issue , 1987, Pages 167-185

  Engelfriet, Joost ^a   Leih, George ^a   Rozenberg, Grzegorz ^a  

^a LEIDEN UNIVERSITY   (Netherlands)

Author keywords

Graph replacements; Neighbourhood controlled embedding; Nonterminal bounded; Nonterminal separation; Regular tree grammars

Indexed keywords

CONTEXT SENSITIVE GRAMMARS; FORMAL LANGUAGES; TREES (MATHEMATICS);

APEX GRAPH; GRAPH GRAMMAR; GRAPH REPLACEMENTS; NEIGHBOURHOOD; NONTERMINAL BOUNDED; REGULAR TREE GRAMMARS; TERMINAL NODES;

GRAPH THEORY;

EID: 85034951004     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-18771-5_52     Document Type: Conference Paper

References (13)

1. J. Berstel; “Transductions and context-free languages”, Teubner, Stuttgart, 1979.
2. 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.
3. F. Gecseg, M. Steinby; “Tree automata”, Akademiai Kiado, Budapest, 1984.
4. S. Ginsburg, E. Spanier; Derivation-bounded languages, JCSS 2 (1968), 228–250.
5. 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.
6. D. Janssens, G. Rozenberg; Restrictions, extensions, and variations of NLC grammars, Information Sciences 20 (1980), 217–244.
7. D. Janssens, G. Rozenberg; Graph grammars with neighbourhood-controlled embedding, Theor.Comp.Science 21 (1982), 55–74.
8. D. Janssens, G. Rozenberg, R. Verraedt; On sequential and parallel node-rewriting graph grammars, Computer Graphics and Image Processing 18 (1982), 279–304.
9. M. Kaul; Syntaxanalyse von Graphen bei Präzedenz-Graph-Grammatiken, Dissertation, Universität Osnabrück, 1985.
10. 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.
11. M. Nagl; “Graph-Grammatiken”, Vieweg, Braunschweig, 1979.
12. G. Rozenberg, E. Welzl; Boundary NLC graph grammars — basic definitions, normal forms, and complexity, Inform. Contr. 69 (1986), 136–167.
13. 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.