Abstract
The present paper deals with the problem of analyzing the value of a random Boolean expression. The expressions are constructed of Boolean operations and constants chosen independently at random with given probabilities. The dependence between the expression value probability and the constants’ probabilities is investigated for different sets of operations. The asymptotic behavior of this dependence is given by a probability function, explicitly obtained through analysis of generating functions for expressions. Special attention is given to the case of binary Boolean operations.
The paper demonstrates some probability function properties and their connection with the properties of Boolean operations used in random expressions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Flajolet, P., Sedgewick, R.: Analytic Combinatorics: Functional Equations, Rational and Algebraic Functions. Research Report 4103, INRIA (2001)
Savický, P.: Complexity and Probability of some Boolean Formulas. Combinatorics, Probability and Computing 7(4), 451–463 (1998)
Chauvin, B., Flajolet, P., Gardy, D., Gittenberger, B.: And/Or trees revisited. Combinatorics, Probability and Computing 13(4-5), 475–497 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yashunsky, A.D. (2005). On the Properties of Asymptotic Probability for Random Boolean Expression Values in Binary Bases. In: Lupanov, O.B., Kasim-Zade, O.M., Chaskin, A.V., Steinhöfel, K. (eds) Stochastic Algorithms: Foundations and Applications. SAGA 2005. Lecture Notes in Computer Science, vol 3777. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11571155_17
Download citation
DOI: https://doi.org/10.1007/11571155_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29498-6
Online ISBN: 978-3-540-32245-0
eBook Packages: Computer ScienceComputer Science (R0)