Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Binary decision graph reduction

Binary decision graph reduction

For access to this article, please select a purchase option:

Buy article PDF
$19.95
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IEE Proceedings E (Computers and Digital Techniques) — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

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.

http://iet.metastore.ingenta.com/content/journals/10.1049/ip-e.1989.0038
Loading

Related content

content/journals/10.1049/ip-e.1989.0038
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address