Francesco Alberti, Silvio Ghilardi, Natasha Sharygina, “Decision Procedures for Flat Array Properties”, J Autom Reasoning, 2015
Alberti F., Ghilardi S., Sharygina N., “A New Acceleration-Based Combination Framework for Array Properties”, Frontiers of Combining Systems, Lecture Notes in Computer Science, 9322, eds. Lutz C., Ranise S., Springer-Verlag Berlin, 2015, 169–185
Francesco Alberti, Silvio Ghilardi, Natasha Sharygina, Lecture Notes in Computer Science, 8413, Tools and Algorithms for the Construction and Analysis of Systems, 2014, 15
М. Н. Вялый, А. А. Рубцов, “Алгоритмическая разрешимость задач о поведении автоматов на сверхсловах”, Дискретн. анализ и исслед. опер., 19:2 (2012), 3–18
Alexander Rabinovich, “The Church problem for expansions of by unary predicates”, Information and Computation, 2012
Alla Sirokofskich, “Decidability questions for a ring of Laurent polynomials”, Annals of Pure and Applied Logic, 2011
Alexis Bès, Alexander Rabinovich, Bruno Courcelle, “Decidable Expansions of Labelled Linear Orderings”, Log.Meth.Comput.Sci, 7:2 (2011)
Ю. Л. Притыкин, “Почти периодичность, конечно-автоматные преобразования и вопросы эффективности”, Изв. вузов. Матем., 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