Automatic Monoids Versus Monoids with Finite Convergent Presentations

Friedrich Otto, Andrea Sattler-Klein, Klaus Madlener. Automatic Monoids Versus Monoids with Finite Convergent Presentations. In Tobias Nipkow, editor, Rewriting Techniques and Applications, 9th International Conference, RTA-98, Tsukuba, Japan, March 30 - April 1, 1998, Proceedings. Volume 1379 of Lecture Notes in Computer Science, pages 32-46, Springer, 1998. [doi]

@inproceedings{OttoSM98,
  title = {Automatic Monoids Versus Monoids with Finite Convergent Presentations},
  author = {Friedrich Otto and Andrea Sattler-Klein and Klaus Madlener},
  year = {1998},
  url = {http://link.springer.de/link/service/series/0558/bibs/1379/13790032.htm},
  researchr = {https://researchr.org/publication/OttoSM98},
  cites = {0},
  citedby = {0},
  pages = {32-46},
  booktitle = {Rewriting Techniques and Applications, 9th International Conference, RTA-98, Tsukuba, Japan, March 30 - April 1, 1998, Proceedings},
  editor = {Tobias Nipkow},
  volume = {1379},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-64301-X},
}