1. V. N. Agafonov, ?Normal sequences and finite automata,? in: Probl. Kibern., No. 20, Nauka, Moscow (1968), pp. 123?129.
2. V. N. Agafonov, The Complexity of Algorithms and Computations. 2, Novosibirsk State Univ. (1975).
3. V. N. Agafonov, ?The complexity of computing pseudorandom sequences,? Algebra Logika, Seminar,7, No. 2, 4?19 (1968).
4. Ya. M. Barzdin', ?Complexity and accuracy of solving initial fragments of the problem of belonging to a recursively enumerable set,? Dokl. Akad. Nauk SSSR,199, No. 2, 262?264 (1971).
5. Ya. M. Barzdin', ?The complexity of programs recognizing whether quantities not exceeding natural numbers belong to a recursively enumerable set,? Dokl. Akad. Nauk SSSR,182, No`. 6, 1249?1252 (1968).