scientific article

zbMath0092.25306MaRDI QIDQ3268318

S. V. Yablonskij, I. A. Chegis

Publication date: 1958

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Related Items (33)

Diagnosis of three types of constant faults in read-once contact networks over finite bases ⋮ The length of a single fault detection test for constant-nonpreserving element insertions ⋮ On algorithms for construction of all irreducible partial covers ⋮ Lower bounds for one-way probabilistic communication complexity and their application to space complexity ⋮ Diagnosis of constant faults in iteration-free circuits over monotone basis ⋮ Estimations of the lengths of tests for logic gates in presence of many permissible faults ⋮ Complete Fault Detection Tests of Length 2 for Logic Networks under Stuck-at Faults of Gates ⋮ Tests of contact closure for contact circuits ⋮ Short single fault detection tests for logic networks under arbitrary faults of gates ⋮ Minimizing depth of decision trees with hypotheses ⋮ Combinatorial results on the complexity of teaching and learning ⋮ Single fault detection tests for generalized iterative switching circuits ⋮ Fault detection tests for stuck-at faults on parity counter inputs ⋮ Short tests of closures for contact circuits ⋮ Shannon function of the test length with respect to gate input identification ⋮ On the exact value of the length of the minimal single diagnostic test for a particular class of circuits ⋮ LOWER BOUNDS FOR LENGTHS OF COMPLETE DIAGNOSTIC TESTS FOR CIRCUITS AND INPUTS OF CIRCUITS ⋮ SINGLE FAULT DETECTION TESTS FOR LOGIC NETWORKS OF AND, NOT GATES ⋮ ON AN INVARIANT FOR THE PROBLEM OF UNDERDETERMINED DATA DECOMPOSING ⋮ Synthesis of easily testable logic networks under arbitrary stuck-at faults at inputs and outputs of gates ⋮ A METHOD FOR CONSTRUCTING LOGIC NETWORKS ALLOWING SHORT SINGLE DIAGNOSTIC TESTS ⋮ On fault detection tests of contact break for contact circuits ⋮ Lower bounds for the lengths of single tests for Boolean circuits ⋮ On the relation between rough set reducts and typical testors ⋮ An overview of the evolution of the concept of testor ⋮ Unit checking output tests under constant faults for functional elements ⋮ Complete diagnostic length 2 tests for logic networks under inverse faults of logic gates ⋮ Bounds on Shannon functions of lengths of contact closure tests for contact circuits ⋮ On diagnostic tests of contact break for contact circuits ⋮ Short single tests for circuits with arbitrary stuck-at faults at outputs of gates ⋮ Lower bound of the length of a single fault diagnostic test with respect to insertions of a mod-2 adder ⋮ Diagnosis of constant faults in read-once contact networks over finite bases ⋮ Synthesis of circuits admitting complete checking tests of constant length under inverse faults at outputs of elements

This page was built for publication: