Abstract
We prove that every Boolean function other than the constant and the identity function can be realized by an irredundant combinational circuit in the basis {xy, x ⊕ y, x ~ y} (in the basis {x ∨ y, x ⊕ y, x ~ y}) that admits a single detection test of length 1 with respect to element insertions not preserving the same constant.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
