On k-match problems

DOI

Search this article

Description

Abstract Several waiting time random variables for a duplication within a memory window of size k in a sequence of {1,2,…,m}-valued random variables are investigated. The exact distributions of the waiting time random variables are derived by the method of conditional probability generating functions. In particular, the exact distribution of the waiting time for the first k-match is obtained when the underlying sequence is generated by higher order Markov dependent trials. Examples for numerical calculations are also given.

Journal

Details 詳細情報について

Report a problem

Back to top