Generalized waiting time problems associated with pattern in Polya's urn scheme
For the random sequence of ball labels obtained from Polya's urn scheme the authors consider the sum of `scores' until a certain pattern occurs. (Every label has a certain score.) They present an infinite system of equations for the conditional probability generating functions of this sum and a truncated version that can be handled by computer algebra systems.
waiting time: probability generating function
scientific article; zbMATH DE number 1901361