Manfred Schmidt-Schauß, Klaus U. Schulz, Lecture Notes in Computer Science, 1379, Rewriting Techniques and Applications, 1998, 61
Renate A. Schmidt, Lecture Notes in Computer Science, 1379, Rewriting Techniques and Applications, 1998, 106
Sergei Vorobyov, Lecture Notes in Computer Science, 1450, Mathematical Foundations of Computer Science 1998, 1998, 597
Kryvyi S., “Unification Problem in Equational Theories”, Cybern. Syst. Anal., 33:6 (1997), 874–899
Karhumaki J., Plandowski W., Mignosi F., “The Expressibility of Languages and Relations by Word Equations”, Automata, Languages and Programming, Lecture Notes in Computer Science, 1256, eds. Degano P., Gorrieri R., MarchettiSpaccamela A., Springer-Verlag Berlin, 1997, 98–109
Diekert V., Matiyasevich Y., Muscholl A., “Solving Trace Equations Using Lexicographical Normal Forms”, Automata, Languages and Programming, Lecture Notes in Computer Science, 1256, eds. Degano P., Gorrieri R., MarchettiSpaccamela A., Springer-Verlag Berlin, 1997, 336–346
Narendran P., Otto F., “The Word Matching Problem Is Undecidable for Finite Special String-Rewriting Systems That Are Confluent”, Automata, Languages and Programming, Lecture Notes in Computer Science, 1256, eds. Degano P., Gorrieri R., MarchettiSpaccamela A., Springer-Verlag Berlin, 1997, 638–648
Yuri Matiyasevich, Lecture Notes in Computer Science, 1234, Logical Foundations of Computer Science, 1997, 248
E. Dantsin, T. Eiter, G. Gottlob, A. Voronkov, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference, 1997, 82
Sabrina Mantaci, Daniele Micciancio, Lecture Notes in Computer Science, 1214, TAPSOFT '97: Theory and Practice of Software Development, 1997, 417