Created by W.Langdon from gp-bibliography.bib Revision:1.8620
http://cswww.essex.ac.uk/staff/poli/papers/PoliLangdonDignumEuroGP2007.pdf",
10.1007/978-3-540-71605-1_18",
Pr{n} = (1 - ap)C_n^{an + 1}(1-p)^{(a-1)n+1} p^n
where n is the number of internal nodes in a tree and p is a constant. This result generalises the result previously reported in \cite{poli:2001:EuroGP_exact}, \cite{mcphee:2001:astamsbgplr}, \cite{Rowe01}, \cite{poli03:ECJ_gener_schem_part_I}, \cite{poli03:ECJ_gener_schem_part_II} for the case a = 1.",
See also \cite{poli:2006:CSM464}",
Genetic Programming entries for Riccardo Poli William B Langdon Stephen Dignum