Abstract
Let H be a finite set; we can suppose H = { 1, 2, …,d } . Consider Hn, the set of length n words over the alphabet H. For every A ∈ Hn define the waiting time for A as the number of experiments needed till A appears as a connected sub-sequence of random elements of H. Formally, let X1, X2,... be i. i. d. random variables, P(X1 = i) = d−1, 1 ≤ i ≤ d then