277 citations to https://www.mathnet.ru/rus/sm2805
  1. Murphy Berzish, Joel D. Day, Vijay Ganesh, Mitja Kulczynski, Florin Manea, Federico Mora, Dirk Nowotka, Lecture Notes in Computer Science, 12847, Combinatorics on Words, 2021, 50  crossref
  2. Antonina Nepeivoda, “Program Specialization as a Tool for Solving Word Equations”, Electron. Proc. Theor. Comput. Sci., 341 (2021), 42  crossref
  3. José Meseguer, Lecture Notes in Computer Science, 12561, Logic-Based Program Synthesis and Transformation, 2021, 3  crossref
  4. Joel D. Day, Florin Manea, “On the structure of solution-sets to regular word equations”, Theory Comput Syst, 2021  crossref
  5. Lars Kristiansen, Juvenal Murwanashyaka, “First-order concatenation theory with bounded quantifiers”, Arch. Math. Logic, 60:1-2 (2021), 77  crossref
  6. Albert Garreta, Robert D. Gray, “On equations and first-order theory of one-relator monoids”, Information and Computation, 281 (2021), 104745  crossref
  7. Igor Sheremet, 2021 International Conference on Information Technology and Nanotechnology (ITNT), 2021, 1  crossref
  8. B. S. Baizhanov, B. Sh. Kulpeshov, T. S. Zambarnaya, “A.D. Taimanov and model theory in Kazakhstan”, Сиб. электрон. матем. изв., 17 (2020), 1–58  mathnet  crossref
  9. В. Г. Дурнев, О. В. Зеткина, А. И. Зеткина, “О «простых» алгоритмически неразрешимых фрагментах элементарной теории бесконечно порожденной свободной полугруппы”, Чебышевский сб., 21:4 (2020), 56–71  mathnet  crossref
  10. GLEB POGUDIN, THOMAS SCANLON, MICHAEL WIBMER, “SOLVING DIFFERENCE EQUATIONS IN SEQUENCES: UNIVERSALITY AND UNDECIDABILITY”, Forum of Mathematics, Sigma, 8 (2020)  crossref
Предыдущая
1
2
3
4
5
6
28
Следующая