External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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]

Authors

Masashi Katsura

This author has not been identified. Look up 'Masashi Katsura' in Google

Yuji Kobayashi

This author has not been identified. Look up 'Yuji Kobayashi' in Google

Friedrich Otto

This author has not been identified. Look up 'Friedrich Otto' in Google
runs on