This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Using Decision Trees to Derive the Complement of a Binary Function with Multiple-Valued Inputs
February 1987 (vol. 36 no. 2)
pp. 212-214
A.H. Chan, MITRE Corporation, Bedford, MA 01730, and the College of Computer Science, Northeastern University
An algorithm to minimize decision trees of Boolean functions with multiple-valued inputs is presented. The recursive algorithm is used to obtain a complement of a sum-of-products expression for a binary function with multiple-valued inputs. In the case where each input is p-valued, the algorithm produces at most pn-l products for n-variable functions, whereas Sasao's algorithm produces pn/2 products. This upper bound on the number of products is the best possible.
Index Terms:
products, Complement of logical expression, decision trees, disjunctive normal form, minimization of logical expressions, multiplevalued logic
Citation:
A.H. Chan, "Using Decision Trees to Derive the Complement of a Binary Function with Multiple-Valued Inputs," IEEE Transactions on Computers, vol. 36, no. 2, pp. 212-214, Feb. 1987, doi:10.1109/TC.1987.1676883
Usage of this product signifies your acceptance of the Terms of Use.