1. Letichevsky, A.A.: Functional equivalence of discrete transducers. Cybernetics, 14–28 (1970)
2. Lecture Notes in Computer Science;L.P. Lisovik,1996
3. Kozen, D.: Lower bounds for natural proof systems. In: 18th Annual Symposium on Foundation of Computer Science (FOCS), pp. 254–266. IEEE, Los Alamitos (1977)
4. Podlovchenko, R.I., Zakharov, V.A.: On the polynomial-time algorithm deciding the commutative equivalence of program schemes. Reports of the Russian Academy of Science 362 (1998)
5. Lecture Notes in Computer Science;V.A. Zakharov,2001