279 citations to https://www.mathnet.ru/rus/sm2805
-
Christian Choffrut, Juhani Karhumäki, Handbook of Formal Languages, 1997, 329
-
Lila Kari, Grzegorz Rozenberg, Arto Salomaa, Handbook of Formal Languages, 1997, 253
-
J. Goubault-Larrecq, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, 1997, 410
-
Joachim Niehren, Manfred Pinkal, Peter Ruhrberg, Lecture Notes in Computer Science, 1249, Automated Deduction—CADE-14, 1997, 34
-
Koscielski A., Pacholski L., “Complexity of Makanin's Algorithm”, J. ACM, 43:4 (1996), 670–684
-
SchmidtSchauss M., “An Algorithm for Distributive Unification”, Rewriting Techniques and Applications, Lecture Notes in Computer Science, 1103, ed. Ganzinger H., Springer-Verlag Berlin, 1996, 287–301
-
Otten J., Kreitz C., “T-String Unification: Unifying Prefixes in Non-Classical Proof Methods”, Theorem Proving with Analytic Tableaux and Related Methods, Lecture Notes in Artificial Intelligence, 1071, eds. Miglioli P., Moscato U., Mundici D., Ornaghi M., Springer-Verlag Berlin, 1996, 244–260
-
A. Degtyarev, A. Voronkov, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, 1996, 503
-
Heinz Faßbender, Sebastian Maneth, Lecture Notes in Computer Science, 1139, Algebraic and Logic Programming, 1996, 194
-
A. Degtyarev, Y. Matiyasevich, A. Voronkov, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, 1996, 494