Quine-McCluskey method for many-valued logical functions
In this paper we deal with a generalization of the Quine-McCluskey method. We show that the generalized method can find a normal form for any finite-valued logical function. Moreover, this normal form is simpler than that found by the intuitive method using the table of values. The method has been successfully implemented and tested on examples.
many-valued logic normal form hardware design logical circuit design