Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. IJ.J. Aalbersberg, A. Ehrenfeucht and G. Rozenberg, "On the membership problem for regular DNLC grammars". Discrete Applied Mathematics 13 (1986), 79–85.
2. IJ.J. Aalbersberg, J. Engelfriet and G. Rozenberg, "The complexity of regular DNLC graph languages". Report 86-03, Rijksuniversiteit Leiden (1986).
3. F. J. Brandenburg, "On the complexity of the membership problem of graph grammars", in: Proceedings of the Workshop on Graphtheoretic Concepts in Computer Science 83, M.Nagl and J. Perl, eds., Tauner-Verlag Linz (1983), 40–49.
4. V. Claus, H. Ehrig, and G Rozenberg (eds.), "Graph Grammars and their Application to Computer Science and Biology", Lecture Notes in Computer Science 73 (1980).
5. A. Ehrenfeucht, M. Main and G. Rozenberg, "Restrictions on NLC graph grammars", Theoret. Comput. Sci 31 (1984), 211–223.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献