P. [. Athreya and . Ney, Branching Processes, 1972.
DOI : 10.1007/978-3-642-65371-1

]. R. Bop85 and . Boppana, Amplification of Probabilistic Boolean Formulas, Proceedings of the 26th IEEE Symposium on Foundations of Computer Science, pp.20-29, 1985.

P. [. Chauvin, D. Flajolet, B. Gardy, and . Gittenberger, And/Or Trees Revisited, Combinatorics, Probability and Computing, vol.13, issue.4-5, pp.475-497, 2004.
DOI : 10.1017/S0963548304006273

M. Drmota, Systems of functional equations. Random Structures and Algorithms, pp.103-124, 1997.
URL : https://hal.archives-ouvertes.fr/hal-01197227

D. [. Fournier, A. Gardy, B. Genitrini, and . Gittenberger, Complexity and Limiting Ratio of Boolean Functions over Implication, 33rd International Symposium on Mathematical Foundations of Computer Science (MFCS'08), pp.347-362, 2008.
DOI : 10.1007/978-3-540-85238-4_28
URL : https://hal.archives-ouvertes.fr/hal-00530525

R. [. Flajolet and . Sedgewick, Analytic Combinatorics, Gar06] D. Gardy. Random Boolean expressions Colloquium on Computational Logic and Applications , volume AF DMTCS Proceedings, pp.1-36, 2006.
DOI : 10.1017/CBO9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

J. Kozik, Subcritical pattern languages for And/Or trees, DMTCS Proceedings, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01194664

]. S. Lal93 and . Lalley, Finite range random walk on free groups and homogeneous trees. The Annals of Probability, pp.2087-2130, 1993.

H. Lefmann and P. Savick´ysavick´y, Some typical properties of large And/Or Boolean formulas. Random Structures and Algorithms, pp.337-351, 1997.

]. O. Lup62 and . Lupanov, Complexity of formula realization of functions of logical algebra English translation: Problems of Cybernetics, Problemy Kibernetiki, vol.3, issue.3, pp.61-80782, 1960.

]. O. Lup65, ?. Lupanov, ?. , and ¬. P. Kibernetiki, On the realization of functions of logical algebra by formulae of finite classes (formulae of limited depth) in the basis English translation: Problems of Cybernetics, pp.5-141, 1961.

J. B. Paris, A. Vencovská, and G. M. Wilmers, A natural prior probability distribution derived from the propositional calculus. Annals of Pure and Applied Logic The number of two terminal series-parallel networks, Journal of Mathematics and Physics, vol.70, issue.21, pp.243-28583, 1942.

]. C. Sha49a and . Shannon, Communication theory of secrecy systems, Bell System Tech. J, vol.28, pp.656-715, 1949.

]. C. Sha49b and . Shannon, The synthesis of two-terminal switching circuits, Bell Systems Technical J, vol.28, pp.59-98, 1949.