Computer Science and Information Technology Vol. 4(2), pp. 72 - 78
DOI: 10.13189/csit.2016.040203
Reprint (PDF) (996Kb)


Blocks of Monotone Boolean Functions


Tkachenco V.G. 1,*, Sinyavsky O.V. 2
1 Odessa National Academy of Telecommunications named after O. S. Popov, Ukraine
2 Military Academy (Odessa), Ukraine

ABSTRACT

This paper first proposed the method of constructing blocks of monotone Boolean functions (MBFs) is developed for classification and the analysis of these functions. Use of only nonisomorphic blocks considerably simplifies enumeration MBFs. Application of the method of construction blocks on the example of classification and analysis of MBFs from 0 to 4 variables is considered. This method can be used at counting of all MBFs of a given rank n.

KEYWORDS
Monotone Boolean Functions, Disjunctive Complement, Conjunctive Complement, Dedekind Number, Free Distributive Lattice

Cite This Paper in IEEE or APA Citation Styles
(a). IEEE Format:
[1] Tkachenco V.G. , Sinyavsky O.V. , "Blocks of Monotone Boolean Functions," Computer Science and Information Technology, Vol. 4, No. 2, pp. 72 - 78, 2016. DOI: 10.13189/csit.2016.040203.

(b). APA Format:
Tkachenco V.G. , Sinyavsky O.V. (2016). Blocks of Monotone Boolean Functions. Computer Science and Information Technology, 4(2), 72 - 78. DOI: 10.13189/csit.2016.040203.