Binary decision graph reduction

Access Full Text

Binary decision graph reduction

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

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

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.

© The Institution of Electrical Engineers
Published

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.

Inspec keywords: Boolean functions; computational complexity; graph theory; many-valued logics; decision theory

Other keywords: programmable; binary decision graph reduction; tabular method; Boolean systems; complexity

Subjects: Programming and algorithm theory; Combinatorial mathematics; Game theory; Formal logic

References

    1. 1)
      • D. Mange , E. Sanchez , A. Stauffer . (1982) , Systems logiques programmes.
    2. 2)
      • B.M. Moret , M.G. Thomason , R.C. Gonzalez . The activity of a variable and its relation to decision trees. ACM Trans. Program. Lang. Syst. , 4 , 580 - 595
    3. 3)
      • P.J. Zsombor-Murray , L.J. Vroomen , R.D. Hudson , L.-N. Tho , P.H. Holck . Binary-decision-based programmable controllers — Part II. IEEE Micro , 5 , 16 - 26
    4. 4)
      • R.T. Boute . The binary-decision machine as programmable controller. Euromicro Newsl. , 2 , 16 - 22
    5. 5)
      • S.B. Aker . Binary decision diagrams. IEEE Trans. Comput. , 6 , 509 - 516
    6. 6)
      • M. Davio , A. Thayse . Optimization of multivalued decision algorithms. Philips J. Res. , 31 - 65
    7. 7)
      • C.Y. Lee . Representation of switching circuits by binary-decision programs. Bell Syst. Tech. J. , 4 , 985 - 999
    8. 8)
      • M. Silva , R. David . Binary-decision graphs for implementation of Boolean functions. IEE Proc. E., Comput. & Digital Tech. , 3 , 175 - 185
    9. 9)
      • P.J. Zsombor-Murray , L.J. Vroomen , R.D. Hudson , L.-N. Tho , P.H. Holck . Binary-decision-based programmable controllers — Part III. IEEE Micro , 6 , 24 - 39
    10. 10)
      • P.J. Zsombor-Murray , L.J. Vroomen , R.D. Hudson , L.-N. Tho , P.H. Holck . Binary-decision-based programmable controllers — Part I. IEEE Micro , 4 , 67 - 83
    11. 11)
      • M. Karpovsky . (1976) , Finite orthogonal series in the design of digital devices.
    12. 12)
      • E. Cerny , D. Mange , E. Sanchez . Synthesis of minimal binary decision trees. IEE Trans. Comput. , 7 , 472 - 482
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