Journal Papers

1. Yu. L. Pritykin. Finite-Automaton Transformations of Strictly Almost-Periodic Sequences. Mathematical Notes, vol. 80, N 5, pp. 710–714, Springer, 2006 (translated from Russian, Matematicheskie Zametki, vol. 80, N 5, pp. 751–756, 2006).
2. Yu. Pritykin. Almost Periodicity, Finite Automata Mappings and Related Effectiveness Issues. Russian Mathematics (Iz VUZ), 2010, N 1, pp. 59–69 (translated from Russian, Izvestiya VUZ. Mathematics, 2010, N 1, pp. 74–87).
3. F. Nicolas and Yu. Pritykin. On Uniformly Recurrent Morphic Sequences. International Journal of Foundations of Computer Science, vol. 20, N 5, pp. 919–940, 2009.
4. Andrej Muchnik, Yuri Pritykin, and Alexei Semenov. Sequences Close to Periodic. Russian Mathematical Surveys, vol. 64, N 5, pp. 805–871, 2009 (translated from Russian, Uspekhi Matematicheskikh Nauk, pp. 21–96, 2009).

Conference Papers

1. Yu. L. Pritykin. Finite automata mappings of strongly almost periodic sequences and algorithmic undecidability. Proceedings of XXVIII Conference of Young Scientists, Moscow State University, pp. 177–181, 2006 (in Russian).
2. Yu. Pritykin. On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases. Proceedings of DLT 2007, Turku, Finland, Lecture Notes in Computer Science 4588, pp. 361–370, Springer, 2007.
3. Yu. Pritykin and M. Raskin. Almost Periodicity and Finite Automata. CD Proceedings of WIWAD, Ekaterinburg, Russia, 2007 (satellite to CSR 2007).
4. Yu. Pritykin. Information in Infinite Words. Proceedings of WORDS 2007, Marseille, France, pp. 254–261.
5. Yu. L. Pritykin. On Non-Regularity of Some Sets of Infinite Words. Proceedings of ITaS 2007, Institute for Information Transmission Problems, Moscow, Russia, pp. 134–137, 2007 (in Russian).
6. Yuri Pritykin and Julya Ulyashkina. Aperiodicity Measure for Infinite Sequences. Proceedings of CSR 2009, Novosibirsk, Russia, Lecture Notes in Computer Science, vol. 5675, pp. 274–285, Springer, 2009. Best student paper award (shared).

Miscellaneous

1. Yuri Pritykin. Algorithmic Properties of Almost Periodic Sequences. Diploma thesis, 27 pages, 2007 (in Russian).
2. Yu. L. Pritykin. Kolmogorov complexity. Mathematical Education (Matematicheskoe Prosveschenie), ser. 3, vol. 13, pp. 127–133, 2009 (in Russian).
3. Yuri Pritykin. On Logical Theories and Finite Automata on Infinite Words. Fundamental mathematics in the work of young scientists (from Anniversary conference of Möbius Contest winners), pp. 101–117, 2009 (in Russian).

23 February, 2010