A set of transformations of certain forms of representation of Boolean functions

Three forms of representing Boolean functions are considered, non-repetitive Boolean formula, linear binary graph, and orthogonal disjunctive normal form. Their one-toone correspondence is demonstrated and a complete system of equivalent transformations is studied. The role of these transformations in computer-aided programming of logical devices is noted.