Abdulrab H., Pecuchet J., “On Word Equations and Makanin Algorithm”, Lect. Notes Comput. Sci., 380 (1989), 1–12
Franz Baader, Lecture Notes in Computer Science, 389, Category Theory and Computer Science, 1989, 273
J. Richard Büchi†, Steven Senger, “Definability in the Existential Theory of Concatenation and Undecidable Extensions of this Theory”, Z Math Logik Grundlagen Math, 34:4 (1988), 337
William M. Farmer, “A unification algorithm for second-order monadic terms”, Annals of Pure and Applied Logic, 39:2 (1988), 131
Karel Culik, Lecture Notes in Computer Science, 317, Automata, Languages and Programming, 1988, 162
J. Richard Büchi, Steven Senger, “Coding in the existential theory of concatenation”, Arch math Logik, 26:1 (1987), 101
Culik K., Karhumaki J., “The Equivalence Problem for Single-Valued 2-Way Transducers (on Npdtol Languages) Is Decidable”, SIAM J. Comput., 16:2 (1987), 221–230
Orevkov V., “Lower Bounds of the Length of Deductions in the Arithmetic Through the Complexity of Terms Participating in Them”, 294, no. 4, 1987, 784–787
Orevkov V., “Reconstruction of a Proof by its Analysis”, 293, no. 2, 1987, 313–316
Karhumaki J., “The Equivalence of Mappings on Languages”, Lect. Notes Comput. Sci., 281 (1987), 26–38