Author:
Engelfriet Joost,Leih George,Rozenberg Grzegorz
Publisher
Springer Berlin Heidelberg
Reference13 articles.
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.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Preface;Theoretical Computer Science;2012-04
2. Context-free graph languages of bounded degree are generated by apex graph grammars;Acta Informatica;1994-04
3. Handle-rewriting hypergraph grammars;Journal of Computer and System Sciences;1993-04
4. Boundary graph grammars with dynamic edge relabeling;Journal of Computer and System Sciences;1990-06
5. Complexity of boundary graph languages;RAIRO - Theoretical Informatics and Applications;1990