Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability

Toshinori Takai, Yuichi Kaji, Hiroyuki Seki. Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability. In Leo Bachmair, editor, Rewriting Techniques and Applications, 11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000, Proceedings. Volume 1833 of Lecture Notes in Computer Science, pages 246-260, Springer, 2000.

@inproceedings{TakaiKS00,
  title = {Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability},
  author = {Toshinori Takai and Yuichi Kaji and Hiroyuki Seki},
  year = {2000},
  tags = {term rewriting, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/TakaiKS00},
  cites = {0},
  citedby = {0},
  pages = {246-260},
  booktitle = {Rewriting Techniques and Applications, 11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000, Proceedings},
  editor = {Leo Bachmair},
  volume = {1833},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-67778-X},
}