Band 34, Heft 2

The propagation criterion for monotone Boolean functions with least vector support sets consisting of one or two vectors is studied. We obtain necessary and sufficient conditions for the validity of the propagation criterion for a vector in terms of the Hamming weights of vectors in least vector support set depending on whether these vectors share some nonzero components with the given vector. We find the cardinality of the set of vectors satisfying the propagation criterion for such functions.

We consider two parsimonious models of binary high-order Markov chains and discover their ability to approximate arbitrary high-order Markov chains. Two types of global measures for approximation accuracy are introduced, theoretical and experimental results are obtained for these measures and for the considered parsimonious models. New consistent statistical parameter estimator is constructed for parsimonious model based on two-layer artificial neural network.

We study the complexity of implementation of systems of monomials by composition circuits. Here, by the complexity we mean the smallest possible number of operations required for computation of the system of monomials from the variables; under this approach, results of intermediate computations can be used several times. The main result of this paper establishes, for an arbitrary system of three monomials of two variables without zeroth powers, a formula for the complexity of their joint implementation by composition circuits with an additive error which is either 1 or 0.

A general cellular circuit of functional and switching elements (CCFSE) is a mathematical model of integral circuits (ICs), which takes into account peculiarities of their physical synthesis. A principal feature of this model distinguishing it from the well-known classes of circuits of gates (CGs) is the presence of additional requirements on the geometry of the circuit which ensure the accounting of the necessary routing resources for IC creation. The complexity of implementation of a multiplexer function of Boolean algebra (FBA) in different classes of circuits has been extensively studied. In the present paper, we give asymptotically sharp upper and lower estimates for the area of a CCFSE implementing a multiplexer FBA of order n . We construct a family of circuit multiplexers of order n of area equal to the halved upper estimate, and provide a method of delivering the corresponding lower estimate.

Replacing the equality in the condition of the homomorphism of a multi-based universal algebra with inequality leads to the definition of an inverse homomorphism of a multi-based universal algebra. In this paper methods for constructing nontrivial inverse homomorphisms of finite groups are studied.