Abstract
ABSTRACT The application of pattern recognition methods in the reduction of two-valued switching functions, in order to achieve minimum redundancy in the number of components, is well known. The object of the present study is to show that in certain special cases it is possible to synthesize switching systems by examining directly the topology of the switching function table and in this way to obtain a system which uses a minimum number of components. The alternative method in such cases is normally to apply the classical methods of Boolean algebra ; however, these are often lengthy and in many of the cases related to complex systems prove quite impracticable. The eventual aim of these pattern recognition techniques is to make possible the synthesis of so-called sequential switching systems.
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.
