Abstract
Boolean algebra is the primary mathematical tool used in designing the computing machines that have come into widespread use in the latter part of this century. Switching functions, described using two-valued Boolean algebra, are implemented using transistor circuits [4]. These transistors act as on-off switches, which is a natural implementation for representing the primitive operations in a Boolean algebra. Once the primitive operations of a Boolean algebra are implemented using transistor circuits, any Boolean function can be implemented using these primitive operations. Operations AND, OR and NOT form the primitive operations of Boolean algebra. Other variations of these primitive operations such and NAND and NOT can also be used as the set of primitive operations.
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.
