A minimization algorithm for ternary switching functions
Tai Cheng Yang, Anthony S. Wojcik · International Symposium on Multiple-Valued Logic · 1976
An algorithm for the minimization of ternary switching functions is described. The algorithm is based on a standard binary switching function simplification method. Systematic methods for finding all prime implicants and a minimal-cost, static-and-dynamic-hazard-free representation for operation-hazard-free ternary switching functions are presented which are suitable for both computer and hand execution. Illustrative examples are also presented.