On the mean number of random digits until a given sequence occurs

Gunnar Blom

doi:10.2307/3213923

Abstract

Random digits are collected one at a time until a given sequence is obtained. The mean number of digits until this happens is determined. Generalizations are given to a stopping region consisting of several sequences of equal length.

Crossref Citations

This article has been cited by the following publications. This list is generated based on data provided by Crossref.

Blom, Gunnar and Thorburn, Daniel 1982. How many random digits are required until given sequences are obtained?. Journal of Applied Probability, Vol. 19, Issue. 3, p. 518.

Blom, Gunnar 1984. On the stochastic ordering of waiting times for patterns in sequences of random digits. Journal of Applied Probability, Vol. 21, Issue. 04, p. 730.

Benevento, Rodolfo V. 1984. The occurrence of sequence patterns in ergodic Markov chains. Stochastic Processes and their Applications, Vol. 17, Issue. 2, p. 369.

Glick, I. I. 1985. More on Waiting Times. ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, Vol. 65, Issue. 1, p. 61.

Banjević, Dragan 1988. On some statistics connected with runs in Markov chains. Journal of Applied Probability, Vol. 25, Issue. 04, p. 815.

Chryssaphinou, O. and Papastavridis, S. 1988. A limit theorem for the number of non-overlapping occurrences of a pattern in a sequence of independent trials. Journal of Applied Probability, Vol. 25, Issue. 02, p. 428.

Godbole, Anant P. 1991. Poisson approximations for runs and patterns of rare events. Advances in Applied Probability, Vol. 23, Issue. 04, p. 851.

Chrysaphinou, O. and Papastavridis, S. 1991. The Occurrence of Sequence Patterns in Repeated Dependent Experiments. Theory of Probability & Its Applications, Vol. 35, Issue. 1, p. 145.

Robin, S. and Daudin, J. J. 1999. Exact distribution of word occurrences in a random sequence of letters. Journal of Applied Probability, Vol. 36, Issue. 1, p. 179.

Robin, S. and Daudin, J. J. 1999. Exact distribution of word occurrences in a random sequence of letters. Journal of Applied Probability, Vol. 36, Issue. 01, p. 179.

Schbath, Sophie 2000. An Overview on the Distribution of Word Counts in Markov Chains. Journal of Computational Biology, Vol. 7, Issue. 1-2, p. 193.

2001. Runs and Scans with Applications. p. 389.

Gani, J. 2003. Stochastic Processes: Modelling and Simulation. Vol. 21, Issue. , p. 227.

Lei Cao and Lei Yao 2005. MAP decoding of variable length codes with self-synchronization strings. Vol. 1, Issue. , p. 517.

Cao, Lei 2006. Self-Synchronization Strings in Huffman Equivalent Codes. p. 347.

Lei Cao Lei Yao and Chang Wen Chen 2007. MAP Decoding of Variable Length Codes With Self-Synchronization Strings. IEEE Transactions on Signal Processing, Vol. 55, Issue. 8, p. 4325.

Maeda, Takashi and Unten, Yuya 2023. On expected waiting time until given words appear in random sequence. Statistics & Probability Letters, Vol. 197, Issue. , p. 109808.

Article contents

On the mean number of random digits until a given sequence occurs

Abstract

Keywords

Access options

This article has been cited by the following publications. This list is generated based on data provided by Crossref.

Article contents

On the mean number of random digits until a given sequence occurs

Abstract

Keywords

Access options

Save article to Kindle

Save article to Dropbox

Save article to Google Drive

Reply to: Submit a response

Your details

You have entered the maximum number of contributors

Conflicting interests