Title :
Binary decision graph reduction
Author_Institution :
Dept. of Electr. Eng., Bayero Univ., Kano, Nigeria
fDate :
7/1/1989 12:00:00 AM
Abstract :
An estimator of the complexity of a binary decision graph is introduced. Based on this, an essentially tabular method of binary decision graph minimisation is presented. The method covers multiple-valued, incompletely specified Boolean systems. The method is well-structured and easily programmable.
Keywords :
Boolean functions; computational complexity; decision theory; graph theory; many-valued logics; Boolean systems; binary decision graph reduction; complexity; programmable; tabular method;
Journal_Title :
Computers and Digital Techniques, IEE Proceedings E
