In:
Journal of Applied Probability, Cambridge University Press (CUP), Vol. 19, No. 03 ( 1982-09), p. 518-531
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.
Type of Medium:
Online Resource
ISSN:
0021-9002
,
1475-6072
DOI:
10.1017/S0021900200037025
Language:
English
Publisher:
Cambridge University Press (CUP)
Publication Date:
1982
detail.hit.zdb_id:
1474599-9
detail.hit.zdb_id:
219147-7
SSG:
3,2
Bookmarklink