S‎witching ‎hypergraphs-‎based‎ decision ‎making‎ and python ‎c‎ode

The notion of binary decision trees plays a wide and important role in application software‎, ‎for example‎, ‎it is widely used in computer-aided design applications‎.‎In this article‎, ‎we present the binary decision hypertree‎, ‎considering the total binary truth table (T.B.T) and the new concepts of hypergraphable Boolean functions and Boolean functionable hypergraphs‎.‎‎As well as in this study we present the concept of unitors set of switching functions and prove that each T.B.T corresponds to a minimum Boolean phrase according to the unitors set‎‎and give several clauses in a certain T.B.T to gain the minimum irreducible Boolean phrase of switching functions‎.‎ ‎Eventually‎, ‎we exhibit an Algorithm and so Python programming (by perfect and basic codes) thus that for each certain T.B.T‎, ‎inset a minimum irreducible switching phrase and so we obtain the binary decision hypertrees‎. ‎The major contribution of this work is to introduce the novel and simple method to the design of reduced ordered binary decision diagrams via the hypergraph(tree)s for the first time in this paper‎.

کلیدواژه ها:

hypergraphable Boolean function‎ ، ‎Boolean functionable hypergraph‎ ، ‎binary decision (hyper)tree