J. Siekmann, P. Szabó, Lecture Notes in Computer Science, 138, 6th Conference on Automated Deduction, 1982, 369
Kazuo Iwama, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982), 1982, 226
Ю. М. Важенин, Б. В. Розенблат, “Разрешимость позитивной теории свободной счетнопорожденной полугруппы”, Матем. сб., 116(158):1(9) (1981), 120–127 ; Yu. M. Vazhenin, B. V. Rozenblat, “Decidability of the positive theory of a free countably generated semigroup”, Math. USSR-Sb., 44:1 (1983), 109–116
Wegner L., “On Parsing 2-Level Grammars”, Acta Inform., 14:2 (1980), 175–193
Jean-Marie Hullot, Lecture Notes in Computer Science, 87, 5th Conference on Automated Deduction Les Arcs, France, July 8–11, 1980, 1980, 318
A. P. Zhezherun, “Decidability of the unification problem for second-order languages with unary functional symbols”, Cybern Syst Anal, 15:5 (1980), 735
Г. С. Маканин, “Распознавание ранга уравнений в свободной полугруппе”, Изв. АН СССР. Сер. матем., 43:3 (1979), 547–602 ; G. S. Makanin, “Recognition of the rank of equations in a free semigroup”, Math. USSR-Izv., 14:3 (1980), 499–545
Jörg Siekmann, Lecture Notes in Computer Science, 72, Symbolic and Algebraic Computation, 1979, 531