Friedrich Otto, Andrea Sattler-Klein. FDT is Undecidable for Finitely Presented Monoids with Solvable Word Problems. In Bogdan S. Chlebus, Ludwik Czaja, editors, Fundamentals of Computation Theory, 11th International Symposium, FCT 97, Kraków, Poland, September 1-3, 1997, Proceedings. Volume 1279 of Lecture Notes in Computer Science, pages 388-399, Springer, 1997.
Abstract is missing.