Publications in Math-Net.Ru
-
On the complexity of the realization of functions of $k$-valued logic by schemes and formulas in functionally complete bases
Diskretn. Anal. Issled. Oper., Ser. 1, 5:2 (1998), 78–89
-
On strongly essential systems of functions in $P_k$
Diskr. Mat., 10:2 (1998), 120–127
-
Realization of $k$-valued functions by circuits of functional elements
Mat. Zametki, 64:3 (1998), 431–436
-
On the completeness of systems of finite automata
Diskr. Mat., 9:2 (1997), 74–78
-
Finding probability characteristics of schemes in automaton bases
Diskr. Mat., 1:1 (1989), 29–31
-
Singularities of Shannon functions in the case of automation bases
Mat. Zametki, 11:1 (1972), 73–82
-
The algorithmic unsolvability of the problem of finding the asymptotic behavior of the Shannon function in the realization of boundedly deterministic operators using networks in an arbitrary basis
Dokl. Akad. Nauk SSSR, 196:5 (1971), 1036–1039
© , 2026