Abstract. We consider an extension of Hayman's notion of admissibility to bivariate generating functions f (z, u) that have the property that the coefficients a nk satisfy a central limit theorem. It is shown that these admissible functions have certain closure properties. Thus, there is a large class of functions for which it is possible to check this kind of admissibility automatically. This is realized with help of a MAPLE program that is also presented. We apply this concept to various combinatorial examples.