System of transformations of certain representations of Boolean functions

From MaRDI portal





Three forms of representation of Boolean functions are considered: the nonrepetitive Boolean formula, the linear binary graph, and the orthogonal disjunctive normal form. A one-to-one correspondence among them is exhibited, and a complete system of equivalent transformations is studied. The role of these transformations in computer-aided programming of logical devices is noted.











This page was built for publication: System of transformations of certain representations of Boolean functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1084377)