Abstract

A set-theoretical approach to the non-disjoint decomposition of different forms of representation of Boolean functions of n variables is considered. This approach is based on the method of p,q-partitions of conjuncterms and on the concept of a decomposition clone. Two techniques of searching for some non-disjoint functional decomposition are described. Theorems on the non-disjoint decomposition of full and partial functions and their systems are formulated. The proposed approach is illustrated by examples.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call