Synthesis of Minimal Binary Decision Trees
Cerny, Mange, Mario Peña Sánchez · IEEE Transactions on Computers · 1979
The concept of binary decision trees is extended to include multiple output Boolean functions. A systematic and programmable method is then developed for the minimization of trees realizing multiple output incompletely specified functions. Further simplification of minimal trees can be achieved through state reduction methods to obtain subminimal decision algorithms. Possible physical realizations of decision trees and algorithms as well as their applications are discussed.