How many random digits are required until given sequences are obtained?

Publisher Website
Google Scholar
Abstract
Random digits are collected one at a time until a given k -digit sequence is obtained, or, more generally, until one of several k -digit sequences is obtained. In the former case, a recursive formula is given, which determines the distribution of the waiting time until the sequence is obtained and leads to an expression for the probability generating function. In the latter case, the mean waiting time is given until one of the given sequences is obtained, or, more generally, until a fixed number of sequences have been obtained, either different sequences or not necessarily different ones. Several results are known before, but the methods of proof seem to be new.