1. Rubtsov, A.A., On Prompting Regular Languages in the Model of Generalized Nondeterministic Automata, in Matematicheskie modeli i zadachi upravleniya (Mathematical Models and Control), Moscow: Moscow Inst. of Physics and Technology, 2011, pp. 61–67.
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. 096–1118.
3. Vyalyi, M.N., On Regular Realizability, Probl. Peredachi Inf., 2011, vol. 47, no. 4, pp. 43–54 [Probl. Inf. Trans. (Engl. Transl.), 2011, vol. 47, no. 4, pp. 342–352].
4. Vyalyi, M.N., On Expressive Power of Regular Realizability, Probl. Peredachi Inf., 2013, vol. 49, no. 3, pp. 86–104 [Probl. Inf. Trans. (Engl. Transl.), 2013, vol. 49, no. 3, pp. 276–291].
5. Berstel, J., Transductions and Context-Free Languages, Stuttgart: Teubner, 1979.