Switching function based on hypergraphs with algorithm and python programming

Abstract

According to Boolean logic, a disjunctive normal form (DNF) is a canonical normal form of a logical formula consisting of a disjunction of conjunctions (it can also be described as an OR of AND’s). For each table an arbitrary T.B.T is given (total binary truth table) Boolean expression can be written as a disjunctive normal form. This paper considers a notation of a T.B.T, introduces a new concept of the hypergraphable Boolean functions and the Boolean functionable hypergraphs with respect to any given T.B.T. This study defines a notation of unitors set on switching functions and proves that every T.B.T corresponds to a minimum Boolean expression via unitors set and presents some conditions on a T.B.T to obtain a minimum irreducible Boolean expression from switching functions. Indeed, we generate a switching function in different way via the concept of hypergraphs in terms of Boolean expression in such a way that it has a minimum irreducible Boolean expression, for every given T.B.T. Finally, an algorithm is presented. Therefore, a Python programming(with complete and original codes) such that for any given T.B.T, introduces a minimum irreducible switching expression.