Selected papers that cite this one
- Antoni Ko\'scielski and Leszek Pacholski. Complexity of Makanin's algorithm. Journal of the ACM, 43(4):670-684, July 1996.
- Antoni Ko\'scielski and Leszek Pacholski. Makanin's algorithm is not primitive recursive. Theoretical Computer Science, 191(1-2):145-156, 30 January 1998.
- Friedrich Otto. Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general. Information Processing Letters, 53(5):237-242, 10 March 1995.