Infinite, Canonical String Rewriting Systems Generated by Completion

Andrea Sattler-Klein. Infinite, Canonical String Rewriting Systems Generated by Completion. In Andrei Voronkov, editor, Logic Programming and Automated Reasoning,International Conference LPAR 92, St. Petersburg, Russia, July 15-20, 1992, Proceedings. Volume 624 of Lecture Notes in Computer Science, pages 433-444, Springer, 1992.

@inproceedings{Sattler-Klein92,
  title = {Infinite, Canonical String Rewriting Systems Generated by Completion},
  author = {Andrea Sattler-Klein},
  year = {1992},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Sattler-Klein92},
  cites = {0},
  citedby = {0},
  pages = {433-444},
  booktitle = {Logic Programming and Automated Reasoning,International Conference LPAR 92, St. Petersburg, Russia, July 15-20, 1992, Proceedings},
  editor = {Andrei Voronkov},
  volume = {624},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-55727-X},
}