<abstract xmlns="http://www.w3.org/1999/xhtml"><p> In the present paper we study properties of pre-complete class of Boolean functions - monotone Boolean functions. We discuss interval graph, the abbreviated d.n.f., a minimal d.n.f. and a shortest d.n.f. of this function. Then we present a d.n.f. with the highest number of conjunctionsand we determinate the exact number of them. We count the number of monotone Boolean functions with some special properties. In the end we estimate the number of Boolean functionthat are monotone and self-dual at the same time.</p></abstract>

In the present paper we study properties of pre-complete class of Boolean functions - monotone Boolean functions. We discuss interval graph, the abbreviated d.n.f., a minimal d.n.f. and a shortest d.n.f. of this function. Then we present a d.n.f. with the highest number of conjunctionsand we determinate the exact number of them. We count the number of monotone Boolean functions with some special properties. In the end we estimate the number of Boolean functionthat are monotone and self-dual at the same time.

The Number of Monotone and Self-Dual Boolean Functions

Comenius University Faculty of Mathematics, Physics and Informatics Department of Computer Science Mlynska dolina, 842 48 Bratislava Slovak Republic

Journal of Applied Mathematics, Statistics and Informatics

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

{"article-title":"The Number of Monotone and Self-Dual Boolean Functions"}

In the present paper we study properties of pre-complete class of Boolean functions - monotone Boolean functions. We discuss interval graph, the abbreviated...

The Number of Monotone and Self-Dual Boolean Functions

Online veröffentlicht: 27. Jan. 2015

Seitenbereich: 93 - 111

DOI: https://doi.org/10.2478/jamsi-2014-0016

© Faculty of Natural Sciences, University of Saint Cyril and Metodius

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.