1. Vyalyi, M.N., On Regular Realizability Problems, Probl. Peredachi Inf., 2011, vol. 47, no. 4, pp. 43–54 [Probl. Inf. Trans. (Engl. Transl.), 2011, vol. 47, no. 4, pp. 342–352].
2. Anderson, T., Loftus, J., Rampersad, N., Santean, N., and Shallit, J., Detecting Palindromes, Patterns and Borders in Regular Languages, Inform. and Comput., 2009, vol. 207, no. 11, pp. 1096–1118.
3. Vyalyi, M.N., On Nondeterminism Models for Two-Way Automata, in Proc. VIII Int. Conf. on Discrete Models in Control System Theory, Moscow, 2009, Moscow: MAKS Press, 2009, pp. 54–60.
4. Vyalyi, M.N. and Tarasov, S.P., Orbits of Linear Maps and Properties of Regular Languages, Diskretn. Anal. Issled. Oper., 2010, vol. 17, no. 6, pp. 20–49 [J. Appl. Ind. Math. (Engl. Transl.), 2011, vol. 5, no. 3, pp. 448–465].
5. Arora, S. and Barak, B., Computational Complexity: A Modern Approach, Cambridge: Cambridge Univ. Press, 2009.