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. R.V. Book, "On the complexity of formal grammars", Acta Informatica, Vol.9 (1978), 171–182
4. 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.
5. E. Dahlhaus and M. Warmuth, "Membership for growing context sensitive grammars is polynomial", Lecture Notes in Computer Science 214 (1986), 85–99.