Abstract
It is shown that various well-known normal forms for Boolean functions can be derived from a very general representation of subfunctions. Another general theorem on the relation between the prime implicants of a function and the prime implicants of its subfunctions is used to prove correct various methods of generating prime implicants.
Sign-in/Register to access full text options 
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.
