The computational complexity of certain graph grammars

Franz-Josef Brandenburg. The computational complexity of certain graph grammars. In Armin B. Cremers, Hans-Peter Kriegel, editors, Theoretical Computer Science, 6th GI-Conference, Dortmund, Germany, January 5-7, 1983, Proceedings. Volume 145 of Lecture Notes in Computer Science, pages 91-99, Springer, 1983.

@inproceedings{Brandenburg83:0,
  title = {The computational complexity of certain graph grammars},
  author = {Franz-Josef Brandenburg},
  year = {1983},
  tags = {graph-rewriting, rewriting, grammar},
  researchr = {https://researchr.org/publication/Brandenburg83%3A0},
  cites = {0},
  citedby = {0},
  pages = {91-99},
  booktitle = {Theoretical Computer Science, 6th GI-Conference, Dortmund, Germany, January 5-7, 1983, Proceedings},
  editor = {Armin B. Cremers and Hans-Peter Kriegel},
  volume = {145},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-11973-6},
}