Abstract
In the paper, 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: IEE Proceedings E Computers and Digital Techniques
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.