Journals Information
Computer Science and Information Technology Vol. 6(4), pp. 47 - 53
DOI: 10.13189/csit.2018.060401
Reprint (PDF) (314Kb)
Maximum MBF Types
Tkachenco V. G. 1,*, Sinyavsky O. V. 2
1 Institute of Radio Television Electronics, Odessa National Academy of Telecommunications, Ukraine
2 Department of Fundamental Sciences, Odessa Military Academy, Ukraine
ABSTRACT
The classification of monotone Boolean functions (MBF) into types is given. The notion of the maximum type of MBF is introduced, and the shift-sum types are constructed. The matrices of type distribution by rank are constructed. Convenient algorithms for finding the number of maximum types and the maximum types themselves are presented. The proposed methods can be used to analyze large MBF ranks.
KEYWORDS
Monotone Boolean Functions, Disjunctive Complement, Conjunctive Complement, MBF Types, Maximum Types, MBF Profile, Free Distributive Lattice
Cite This Paper in IEEE or APA Citation Styles
(a). IEEE Format:
[1] Tkachenco V. G. , Sinyavsky O. V. , "Maximum MBF Types," Computer Science and Information Technology, Vol. 6, No. 4, pp. 47 - 53, 2018. DOI: 10.13189/csit.2018.060401.
(b). APA Format:
Tkachenco V. G. , Sinyavsky O. V. (2018). Maximum MBF Types. Computer Science and Information Technology, 6(4), 47 - 53. DOI: 10.13189/csit.2018.060401.