Abstract
A systematic method of testing and realization of Boolean functions with a large number of unspecified states by a single threshold logic element has been presented in this paper. By this method, it is possible to determine many different threshold realizations of the given incomplete function. The method can be applied to switching functions containing any number of variables.
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.
