The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (1979 vol.28)
pp: 472-482
E. Cerny , Department of Computer Science and Operations Research, University of Montreal
ABSTRACT
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.
INDEX TERMS
standard sets of implicants, Binary decision machines, binary decision trees, characteristic functions, decision algorithms, minimization
CITATION
E. Cerny, D. Mange, E. Sanchez, "Synthesis of Minimal Binary Decision Trees", IEEE Transactions on Computers, vol.28, no. 7, pp. 472-482, July 1979, doi:10.1109/TC.1979.1675391
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool