Publications in Math-Net.Ru
-
Provision of Complete Verifiability of Programmable Logic Matrices with Large Number of Entries
Avtomat. i Telemekh., 1996, no. 10, 179–188
-
Construction of short complete test sets for programmable logic arrays
Avtomat. i Telemekh., 1995, no. 10, 127–137
-
Test-suitable implementation of combinational automaton by PLM
Avtomat. i Telemekh., 1993, no. 11, 143–152
-
On complete checking of programmable logical matrices. II
Avtomat. i Telemekh., 1984, no. 7, 137–146
-
On complete checking of programmable logical matrices. I
Avtomat. i Telemekh., 1984, no. 6, 146–153
© , 2024