Yuri Pritykin, Lecture Notes in Computer Science, 4588, Developments in Language Theory, 2007, 361
С. М. Дудаков, “Трансляционный результат для расширений арифметики Пресбургера одноместной функцией, согласованной со сложением”, Матем. заметки, 76:3 (2004), 362–371 ; S. M. Dudakov, “Collapse Result for Extensions of the Presburger Arithmetic by a Unary Function Compatible with Addition”, Math. Notes, 76:3 (2004), 339–347
Pure and Applied Mathematics, 141, Infinite Words - Automata, Semigroups, Logic and Games, 2004, 499
William Gasarch, G.R.. Hird, “Automata techniques for query inference machines”, Annals of Pure and Applied Logic, 117:1-3 (2002), 169
Ivan Korec, “A list of arithmetical structures complete with respect to the first-order definability”, Theoretical Computer Science, 257:1-2 (2001), 115
Arnaud Maes, “Morphisms and almost-periodicity”, Discrete Applied Mathematics, 86:2-3 (1998), 233
Jean-Eric Pin, “Logic, semigroups and automata on words”, Ann Maths Artificial Intell, 16:1 (1996), 343
Christian Michaux, Roger Villemaire, “Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems”, Annals of Pure and Applied Logic, 77:3 (1996), 251
Christian Michaux, Roger Villemaire, Lecture Notes in Computer Science, 700, Automata, Languages and Programming, 1993, 325
Roger Villemaire, “The theory of is undecidable”, Theoretical Computer Science, 106:2 (1992), 337