Undecidability Results for Monoids with Linear-Time Decidable Word Problems

Masashi Katsura, Yuji Kobayashi, Friedrich Otto. Undecidability Results for Monoids with Linear-Time Decidable Word Problems. In D. T. Lee, Shang-Hua Teng, editors, Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings. Volume 1969 of Lecture Notes in Computer Science, pages 278-289, Springer, 2000. [doi]

Abstract

Abstract is missing.