The following publications are possibly variants of this publication:
- The Property Fdt is Undecidable for Finitely Presented Monoids that Have Polynomial-Time Decidable Word ProblemsFriedrich Otto, Andrea Sattler-Klein. ijac, 10(3):285-308, 2000. [doi]
- Th Word Problem for Finitely Presented Monoids and Finite Canonical Rewriting SystemsCraig C. Squier, Friedrich Otto. RTA 1987: 74-82
- FDT is Undecidable for Finitely Presented Monoids with Solvable Word ProblemsFriedrich Otto, Andrea Sattler-Klein. fct 1997: 388-399
- Pseudo-Natural Algorithms for the Word Problem for Finitely Presented Monoids and GroupsKlaus Madlener, Friedrich Otto. JSC, 1(4):383-418, 1985.
- Infinite Convergent String-Rewriting Systems and Cross-Sections for Finitely Presented MonoidsFriedrich Otto, Masashi Katsura, Yuji Kobayashi. JSC, 26(5):621-648, 1998.
- Undecidable properties of monoids with word problem solvable in linear time. Part II-- cross sections and homological and homotopical finiteness conditionsMasashi Katsura, Yuji Kobayashi, Friedrich Otto. TCS, 1-3(301):79-101, 2003. [doi]
- Deciding Algebraic Properties of Monoids Presented by Finite Church-Rosser Thue SystemsFriedrich Otto. RTA 1985: 95-106
- A Finitely Presented Monoid Which Has Solvable Word Problem But Has No Regular Complete PresentationYuji Kobayashi. TCS, 146(1&2):321-329, 1995. [doi]
- Undecidability Results for Monoids with Linear-Time Decidable Word ProblemsMasashi Katsura, Yuji Kobayashi, Friedrich Otto. isaac 2000: 278-289 [doi]