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.
Language: English
Page range: 93 - 111
Published on: Jan 27, 2015
Published by: University of Ss. Cyril and Methodius in Trnava
In partnership with: Paradigm Publishing Services
Publication frequency: 2 issues per year
Keywords:
Related subjects:
© 2015 L. Haviarova, E. Toman, published by University of Ss. Cyril and Methodius in Trnava
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.