Ю. Л. Притыкин, “Почти периодичность, конечно-автоматные преобразования и вопросы эффективности”, Изв. вузов. Матем., 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
Alla Sirokofskich, “On an exponential predicate in polynomials over finite fields”, Proc. Amer. Math. Soc., 138:7 (2010), 2569
Alexis Bès, Alexander Rabinovich, Lecture Notes in Computer Science, 6300, Fields of Logic and Computation, 2010, 95
Ан. А. Мучник, Ю. Л. Притыкин, А. Л. Семенов, “Последовательности, близкие к периодическим”, УМН, 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
FRANCOIS NICOLAS, YURI PRITYKIN, “ON UNIFORMLY RECURRENT MORPHIC SEQUENCES”, Int. J. Found. Comput. Sci, 20:05 (2009), 919
Alla Sirokofskich, Lecture Notes in Computer Science, 5635, Mathematical Theory and Computational Practice, 2009, 437
Alexander Rabinovich, Lecture Notes in Computer Science, 5771, Computer Science Logic, 2009, 424
Alexander Rabinovich, “On decidability of monadic logic of order over the naturals extended by monadic predicates”, Information and Computation, 205:6 (2007), 870
Pascal Michel, “Computational complexity of logical theories of one successor and another unary function”, Arch. Math. Logic, 46:2 (2007), 123