Synthesis of Minimal Binary Decision Trees

Authors:
E. Cerny;D. Mange;E. Sanchez
Affiliations:
Department of Computer Science and Operations Research, University of Montreal;-;-
Venue:
IEEE Transactions on Computers
Year:
1979

Citing 0
Cited 6

A General Model for Memory-Based Finite-State Machines

IEEE Transactions on Computers
Synthesis and Optimization of Programs by Means of P-Functions

IEEE Transactions on Computers
A Matrix Formalism for Asynchronous Implementation of Algorithms

IEEE Transactions on Computers
Synthesis and Asynchronous Implementation of Algorithms Using a Generalized P-Function Concept

IEEE Transactions on Computers
Symmetric and Threshold Boolean Functions Are Exhaustive

IEEE Transactions on Computers
P-Functions: a new tool for the analysis and synthesis of binary programs

IEEE Transactions on Computers

Quantified Score

Hi-index	15.00

Visualization

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.