On Closedness and Test Complexity of Logic Circuits
From MaRDI portal
Publication:3912732
DOI10.1109/TC.1981.1675840zbMath0461.94019MaRDI QIDQ3912732
Publication date: 1981
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Fault detection; testing in circuits and networks (94C12) Switching theory, applications of Boolean algebras to circuits and networks (94C11)
Related Items
Short complete diagnostic tests for circuits implementing linear Boolean functions, An analysis of root functions -- a subclass of the impossible class of faulty functions (ICFF)