Boolean Expression Based on Hypergraphs With Algorithm

This paper introduces a novel concept of boolean function–based hypergraph with respect to any given t.b.t(total binary truth table). this study defines a notation of kernel set on switching functions and proves that every t.b.t corresponds to a minimum boolean expression via kernel set and presents some conditions on t.b.t to obtain a minimum irreducible boolean expression from switching functions. finally, we present an algorithm and so python programming(with complete and original codes) such that for any given t.b.t, introduces a minimum irreducible switching expression.