1. A. Thue, “Probleme über Veränderungen von Zeichenreihen nach gegebenen Regeln,” Videnskabsselsk. Skr. I. Mat.-Naturvidensk. KI., 10 (1914).
2. A. A. Markov, “Impossibility of certain algorithms in the theory of associative systems,” Dokl. Akad. Nauk SSSR 55 (7), 587–590 (1947).
3. E. L. Post, “Recursive unsolvability of a problem of Thue,” J. Symbolic Logic 12 (1), 1–11 (1947). https://doi.org/10.2307/2267170
4. S. I. Adian and V. G. Durnev, “Decision problems for groups and semigroups,” Russ. Math. Surv. 55 (2), 207–296 (2000). https://doi.org/10.1070/RM2000v055n02ABEH000267
5. R. E. Ladner, “The computational complexity of provability in systems of modal propositional logic,” SIAM J. Comput. 6 (3), 467–480 (1977). https://doi.org/10.1137/0206033