Franz Baader, Klaus U. Schulz, Lecture Notes in Computer Science, 607, Automated Deduction—CADE-11, 1992, 50
Klaus U. Schulz, Lecture Notes in Computer Science, 572, Word Equations and Related Topics, 1992, 85
William M. Farmer, “Simple second-order languages for which unification is undecidable”, Theoretical Computer Science, 87:1 (1991), 25
Narjes Doggaz, Claude Kirchner, “Completion for unification”, Theoretical Computer Science, 85:2 (1991), 231
Gernot Salzer, Informatik-Fachberichte, 287, 7. Österreichische Artificial-Intelligence-Tagung / Seventh Austrian Conference on Artificial Intelligence, 1991, 103
Jean-François Romeuf, “A polynomial algorithm for solving systems of two linear diophantine equations”, Theoretical Computer Science, 74:3 (1990), 329
Taimanov A., Taimanov V., “On the Representation of the Solution of Equation in Free Semigroup Without Unit”, 312, no. 2, 1990, 274–276
Orevkov V., “Correctness of Short Proofs in Theory with Notions of Feasibility”, Lect. Notes Comput. Sci., 417 (1990), 242–245
Abdulrab H., “Solving Word Equations”, Rairo-Inform. Theor. Appl.-Theor. Inform. Appl., 24:2 (1990), 109–130
Neraud J., “On the Deficit of a Finite-Set of Words”, Semigr. Forum, 41:1 (1990), 1–21