Decidable Boundedness Problems for Sets of Graphs Generated by Hyperedge-Replacement

Annegret Habel, Hans-Jörg Kreowski, Walter Vogler. Decidable Boundedness Problems for Sets of Graphs Generated by Hyperedge-Replacement. Theoretical Computer Science, 89(1):33-62, 1991.

@article{HabelKV91,
  title = {Decidable Boundedness Problems for Sets of Graphs Generated by Hyperedge-Replacement},
  author = {Annegret Habel and Hans-Jörg Kreowski and Walter Vogler},
  year = {1991},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/HabelKV91},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {89},
  number = {1},
  pages = {33-62},
}