Geodesic
Short conditional complete diagnostic tests for circuits under one-type constant faults of gates
Diskretnaya Matematika, Tome 34 (2022) no. 3, pp. 63-69

Voir la notice de l'article provenant de la source Math-Net.Ru

We prove that any (almost any) $n$-place Boolean function can be implemented by a logic circuit in the “conjunction, disjunction, implication, negation” basis admitting a conditional complete diagnostic test of length at most $n$ (at most $n-1$, respectively) relative to constant faults of type $0$ on outputs of gates.
Keywords: logic circuit, conditional test, complete diagnostic test, constant fault, Boolean function. 
@article{DM_2022_34_3_a4,
     author = {K. A. Popkov},
     title = {Short conditional complete diagnostic tests for circuits under one-type constant faults of gates},
     journal = {Diskretnaya Matematika},
     pages = {63--69},
     publisher = {mathdoc},
     volume = {34},
     number = {3},
     year = {2022},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2022_34_3_a4/}
}
TY  - JOUR
AU  - K. A. Popkov
TI  - Short conditional complete diagnostic tests for circuits under one-type constant faults of gates
JO  - Diskretnaya Matematika
PY  - 2022
SP  - 63
EP  - 69
VL  - 34
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2022_34_3_a4/
LA  - ru
ID  - DM_2022_34_3_a4
ER  - 
%0 Journal Article
%A K. A. Popkov
%T Short conditional complete diagnostic tests for circuits under one-type constant faults of gates
%J Diskretnaya Matematika
%D 2022
%P 63-69
%V 34
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2022_34_3_a4/
%G ru
%F DM_2022_34_3_a4
K. A. Popkov. Short conditional complete diagnostic tests for circuits under one-type constant faults of gates. Diskretnaya Matematika, Tome 34 (2022) no. 3, pp. 63-69. http://geodesic.mathdoc.fr/item/DM_2022_34_3_a4/