Abstract
This note discusses the generation of ternary threshold functions of three variables. Merrill's generation method to generate ternary threshold functions is modified. The number of ternary threshold functions of three variables is counted by a computer, the number is 85629. Tables of characterizing parameters of canonical ternary threshold functions of two and three variables are presented. A table-lookup method to realize ternary threshold functions is given. It is verified that the complete monotonicity (three-value extension of the complete monotonicity in two-valued logic) is a sufficient condition for a ternary three-variable switching function to be a ternary threshold function.
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.
