Some Undecidability Results for Weakly Confluent Monadic String-Rewriting Systems

Friedrich Otto. Some Undecidability Results for Weakly Confluent Monadic String-Rewriting Systems. In Harold F. Mattson, Teo Mora, T. R. N. Rao, editors, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 9th International Symposium, AAECC-9, New Orleans, LA, USA, October 7-11, 1991, Proceedings. Volume 539 of Lecture Notes in Computer Science, pages 292-303, Springer, 1991.

Abstract

Abstract is missing.