The Complexitiy of Testing Ground Reducibility for Linear Word Rewriting Systems with Variables

Gregory Kucherov, Michaël Rusinowitch. The Complexitiy of Testing Ground Reducibility for Linear Word Rewriting Systems with Variables. In Nachum Dershowitz, Naomi Lindenstrauss, editors, Conditional and Typed Rewriting Systems, 4th International Workshop, CTRS-94, Jerusalem, Israel, July 13-15, 1994, Proceedings. Volume 968 of Lecture Notes in Computer Science, pages 262-275, Springer, 1994.

@inproceedings{KucherovR94,
  title = {The Complexitiy of Testing Ground Reducibility for Linear Word Rewriting Systems with Variables},
  author = {Gregory Kucherov and Michaël Rusinowitch},
  year = {1994},
  tags = {testing, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/KucherovR94},
  cites = {0},
  citedby = {0},
  pages = {262-275},
  booktitle = {Conditional and Typed Rewriting Systems, 4th International Workshop, CTRS-94, Jerusalem, Israel, July 13-15, 1994, Proceedings},
  editor = {Nachum Dershowitz and Naomi Lindenstrauss},
  volume = {968},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-60381-6},
}