279 citations to https://www.mathnet.ru/rus/sm2805
  1. Rybakov V., “Equations in Free Closure Algebra and the Substitution Problem”, 287, no. 3, 1986, 554–557  mathscinet  zmath  isi
  2. Jon Barwise, Solomon Feferman, David Israel, “Meeting of the Association for Symbolic Logic, Stanford, California, 1985”, J. symb. log, 51:03 (1986), 832  crossref  mathscinet
  3. Keijo Ruohonen, The Book of L, 1986, 393  crossref
  4. Regina Llopis de Trias, Lecture Notes in Computer Science, 204, EUROCAL '85, 1985, 424  crossref
  5. Stefan Arnborg, Erik Tidén, Lecture Notes in Computer Science, 202, Rewriting Techniques and Applications, 1985, 398  crossref
  6. А. А. Разборов, “О системах уравнений в свободной группе”, Изв. АН СССР. Сер. матем., 48:4 (1984), 779–832  mathnet  mathscinet  zmath; A. A. Razborov, “On systems of equations in a free group”, Math. USSR-Izv., 25:1 (1985), 115–162  crossref
  7. J.P Pecuchet, “Solutions principales et rang d'un système d'équations avec constantes dans le monoïde libre”, Discrete Mathematics, 48:2-3 (1984), 253  crossref  mathscinet  zmath
  8. Jörg H. Siekmann, Lecture Notes in Computer Science, 170, 7th International Conference on Automated Deduction, 1984, 1  crossref
  9. François Fages, Lecture Notes in Computer Science, 170, 7th International Conference on Automated Deduction, 1984, 194  crossref
  10. K.N. Venkataraman, Ann Yasuhara, Frank M. Hawrusik, “A view of computability on term algebras”, Journal of Computer and System Sciences, 26:3 (1983), 410  crossref  mathscinet  zmath
Предыдущая
1
24
25
26
27
28
Следующая