279 citations to https://www.mathnet.ru/rus/sm2805
  1. Tsuyoshi Yukami, “A theorem on generalizations of proofs”, Arch Math Logic, 30:3 (1990), 139  crossref
  2. Jean Neraud, “Elementariness of a finite set of words is co-NP-complete”, RAIRO-Theor. Inf. Appl., 24:5 (1990), 459  crossref
  3. J. Richard Büchi, Steven Senger, The Collected Works of J. Richard Büchi, 1990, 665  crossref
  4. Keith Wright, Colt Proceedings 1990, 1990, 111  crossref
  5. Joxan Jaffar, “Minimal and complete word unification”, J. ACM, 37:1 (1990), 47  crossref
  6. J. Richard Büchi, Steven Senger, The Collected Works of J. Richard Büchi, 1990, 671  crossref
  7. A. Koscielski, L. Pacholski, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, 1990, 824  crossref
  8. Abdulrab H., Pecuchet J., “Solving Word Equations”, J. Symbolic Comput., 8:5 (1989), 499–521  crossref  mathscinet  zmath  isi
  9. Abdulrab H., “Equations in Words”, Lect. Notes Comput. Sci., 358 (1989), 508–520  crossref  mathscinet  isi
  10. Abdulrab H., Pecuchet J., “Solving Systems of Linear Diophantine Equations and Word Equations”, Lect. Notes Comput. Sci., 355 (1989), 530–532  isi
Предыдущая
1
22
23
24
25
26
27
28
Следующая