Bernoulli distribution transformations by Boolean functions from closed classes
نویسندگان
چکیده
منابع مشابه
On the Lattice of Equational Classes of Boolean Functions and Its Closed Intervals
Let A be a finite set with |A| ≥ 2. The composition of two classes I and J of operations on A, is defined as the set of all composites f(g1, . . . , gn) with f ∈ I and g1, . . . , gn ∈ J . This binary operation gives a monoid structure to the set EA of all equational classes of operations on A. The set EA of equational classes of operations on A also constitutes a complete distributive lattice ...
متن کاملBiologically Relevant Classes of Boolean Functions
A large influx of experimental data has prompted the development of innovative computational techniques for modeling and reverse engineering biological networks. While finite dynamical systems, in particular Boolean networks, have gained attention as relevant models of network dynamics, not all Boolean functions reflect the behaviors of real biological systems. In this work, we focus on two cla...
متن کاملSome properties of extended multiplier transformations to the classes of meromorphic multivalent functions
In this paper, we introduce new classes $sum_{k,p,n}(alpha ,m,lambda ,l,rho )$ and $mathcal{T}_{k,p,n}(alpha ,m,lambda ,l,rho )$ of p-valent meromorphic functions defined by using the extended multiplier transformation operator. We use a strong convolution technique and derive inclusion results. A radius problem and some other interesting properties of these classes are discussed.
متن کاملThe Growing Trees Distribution on Boolean Functions
We define a probability distribution over the set of Boolean functions of k variables induced by the tree representation of Boolean expressions. The law we are interested in is inspired by the growth model of Binary Search Trees: we call it the growing trees law. We study it over different logical systems and compare the results we obtain to already known distributions induced by the tree repre...
متن کاملThe growing tree distribution on Boolean functions
We define a probability distribution over the set of Boolean functions of k variables induced by the tree representation of Boolean expressions. The law we are interested in is inspired by the growth model of Binary Search Trees: we call it the growing tree law. We study it over different logical systems and compare the results we obtain to already known distributions induced by the tree repres...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Keldysh Institute Preprints
سال: 2016
ISSN: 2071-2898,2071-2901
DOI: 10.20948/prepr-2016-38