Entropic minimization of multiple-valued functions

An information-theoretic procedure for minimizing multiple-valued switching function is outlined. The procedure has been developed as an extension of previous works about heuristic decision making and binary switching function minimization for the sum of products expansion of the function to be minimized. To show how the proposed procedure works, a complete example for a three-variable, four-valued function is given. In addition, certain global results for four-variable, four-valued functions are shown.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>