Abstract

This paper entails the development of bound equations on the number of minimized fuzzy switching functions. A triangular matrix representing the transitivity between fundamental fuzzy phrases is discussed and applied in the enumeration process. Improved upper and lower bounds have been developed by use of the transitivity matrix. In addition, an algorithm is described to calculate the number of distinct fuzzy switching functions for 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 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.