Abstract
It was proved that one can implement any non-constant Boolean function in n variables by an irredundant logic network in the basis {&, ⊕,¬}, allowing, when n ≥ 3, a single fault detection test with length not more than 6n - 10 relative to arbitrary faults of gates.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
