The following publications are possibly variants of this publication:
- About the Descriptive Power of Certain Classes of Finite String-Rewriting SystemsKlaus Madlener, Friedrich Otto. TCS, 67(2&3):143-172, 1989.
- Using String-Rewriting for Solving the Word Problem for Finitely Presented GroupsKlaus Madlener, Friedrich Otto. ipl, 24(5):281-284, 1987.
- Properties of Monoids That Are Presented by Finite Convergent String-Rewriting Systems - A SurveyFriedrich Otto, Yuji Kobayashi. BIRTHDAY 1997: 225-266
- Infinite Convergent String-Rewriting Systems and Cross-Sections for Finitely Presented MonoidsFriedrich Otto, Masashi Katsura, Yuji Kobayashi. JSC, 26(5):621-648, 1998.
- A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting GroupsKlaus Madlener, Paliath Narendran, Friedrich Otto. icalp 1991: 279-290
- It is undecidable whether a finite special string-rewriting system presents a groupPaliath Narendran, Colm Ó Dúnlaing, Friedrich Otto. DM, 98(2):153-159, 1991. [doi]
- Completing a Finite Special String-Rewriting System on the Congruence Class of the Empty WordFriedrich Otto. aaecc, 2:257-274, 1991.
- On Deciding the Confluence of a Finite String-Rewriting System on a Given Congruence ClassFriedrich Otto. jcss, 35(3):285-310, 1987.