Abstract

This paper continues the series based on the use of matrices in the design of switching networks. To avoid redundancy within the series, all previous papers on matrix logic are considered as prerequisite, in particular, references 1 and 2. This paper establishes a general classification scheme for logical functions, as follows: 1. General symmetric functions, which are the sum of ordinary symmetric functions. 2. Trivial and redundant functions. 3. Universal functions, which are capable of performing any logical functions by appropriate iterations.

Full Text
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

Disclaimer: 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.