Subcritical pattern languages for and/or trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2008

Subcritical pattern languages for and/or trees


Let $P_k(f)$ denote the density of and/or trees defining a boolean function $f$ within the set of and/or trees with fixed number of variables $k$. We prove that there exists constant $B_f$ such that $P_k(f) \sim B_f \cdot k^{-L(f)-1}$ when $k \to \infty$, where $L(f)$ denote the complexity of $f$ (i.e. the size of a minimal and/or tree defining $f$). This theorem has been conjectured by Danièle Gardy and Alan Woods together with its counterpart for distribution $\pi$ defined by some critical Galton-Watson process. Methods presented in this paper can be also applied to prove the analogous property for $\pi$.
Fichier principal
Vignette du fichier
dmAI0129.pdf (239.55 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01194664 , version 1 (07-09-2015)



Jakub Kozik. Subcritical pattern languages for and/or trees. Fifth Colloquium on Mathematics and Computer Science, 2008, Kiel, Germany. pp.437-448, ⟨10.46298/dmtcs.3582⟩. ⟨hal-01194664⟩


71 View
417 Download



Gmail Facebook Twitter LinkedIn More