Valérie Berthé, Toghrul Karimov, Joris Nieuwveld, Joël Ouaknine, Mihir Vahanwala, James Worrell, Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024, 1
Mikhail R. Starchak, Lecture Notes in Computer Science, 14773, Twenty Years of Theoretical and Practical Synergies, 2024, 218
V. V. Verbovskiy, A. D. Yershigeshova, “On o-Stable Expansions of $\boldsymbol{(\mathbb{Z},<,+)}$”, Lobachevskii J Math, 44:12 (2023), 5485
Alexei Semenov, Sergei Soprunov, “Automorphisms and Definability (of Reducts) for Upward Complete Structures”, Mathematics, 10:20 (2022), 3748
А. Л. Семенов, С. Ф. Сопрунов, “Решетка определимости. Источники и направления исследований”, Чебышевский сб., 22:1 (2021), 304–327 ; A. L. Semenov, S. F. Soprunov, “The lattice of definability. Origins and directions of research”, Doklady Mathematics (Supplementary issues), 106:2 (2022), 288–298
Gabriel Conant, “Multiplicative structure in stable expansions of the group of integers”, Illinois J. Math., 62:1-4 (2018)
Alexei Semenov, Sergey Soprunov, Vladimir Uspensky, Lecture Notes in Computer Science, 8476, Computer Science - Theory and Applications, 2014, 23
Ю. Л. Притыкин, “Почти периодичность, конечно-автоматные преобразования и вопросы эффективности”, Изв. вузов. Матем., 2010, № 1, 74–87 ; Yu. L. Pritykin, “Almost periodicity, finite automata mappings, and related effectiveness issues”, Russian Math. (Iz. VUZ), 54:1 (2010), 59–69
А. С. Снятков, “Разрешимость теории $\mathrm{Th}(\omega,0,1,<,+,f_0,\dots,f_n)$”, Модел. и анализ информ. систем, 17:3 (2010), 72–90
Ан. А. Мучник, Ю. Л. Притыкин, А. Л. Семенов, “Последовательности, близкие к периодическим”, УМН, 64:5(389) (2009), 21–96 ; An. A. Muchnik, Yu. L. Pritykin, A. L. Semenov, “Sequences close to periodic”, Russian Math. Surveys, 64:5 (2009), 805–871