1. F.M.Ablaev, On the problem of reduction of automata, Izvestija VUZ. Matematika, 1980, No.3, 75–77 (Russian).
2. F.M.Ablaev, Capabilities of probabilistic machines to represent languages in real time, Izvestija VUZ. Matematika, 1985, No.7, 32–40 (Russian).
3. J.M. Barzdin, Complexity of recognition of palindromes by Turing machines, Problemy kibernetiki, v.15, Moscow, Nauka, 1965, 245–248 (Russian).
4. J.M. Barzdin, On computability by probabilistic machines, Doklady AN SSSR, 1969, v.189, No.4, 699–702 (Russian).
5. R.G. Bukharaev, Foundations of the theory of probabilistic automata, Moscow, Nauka, 1985.