scientific article; zbMATH DE number 3693155

MaRDI QIDQ3887347zbMATH OpenFDO

Authors N. A. Solov'Ev

Publication date 1978

zbMATH Keywords

graphsfault detectionBoolean functionstest generationfault diagnosiscombinational circuits

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Fault detection; testing in circuits and networks (94C12) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01)

Recommendations

• scientific article; zbMATH DE number 3885799
• scientific article; zbMATH DE number 193822
• scientific article; zbMATH DE number 47895
• On the length of diagnostic tests for Boolean circuits
• Design of easily testable combinational circuits

Cited in

(14)

• scientific article; zbMATH DE number 4006161 (Why is no real title available?)
• scientific article; zbMATH DE number 4006162 (Why is no real title available?)
• scientific article; zbMATH DE number 3885799 (Why is no real title available?)
• On the essential test sets of discrete matrices
• Reliability and diagnostics of circuits
• Combinatorial results on the complexity of teaching and learning
• Construction of the tests of combinational circuit failures by analyzing the orthogonal disjunctive normal forms represented by the alternative graphs
• Lower bounds for one-way probabilistic communication complexity and their application to space complexity
• A bound on information cost of circuit diagnosing tests
• Mathematical principles of boundary scan test generation
• Elements of the diagnostic theory of tolerance and similarity
• On searching for test experiments using rough sets theory
• scientific article; zbMATH DE number 47895 (Why is no real title available?)
• On correctness conditions for algebra of recognition algorithms with \({\mu}\)-operators over pattern problems with binary data

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3887347)