Abstract
The pattern (k(1), k(2), ... , k(l)) is defined to have at least k(1) consecutive 1's followed by at least k(2) consecutive 2's, ... , followed by at least k(l) consecutive l's. By iteratively applying the method that was developed previously to decouple the combinatorial complexity involved in studying complicated patterns in random sequences, the distribution of pattern (k(1), k(2), ... , k(l)) is derived for arbitrary e. Numerical examples are provided to illustrate the results. (c) 2021 Elsevier B.V. All rights reserved.
NSTL
Elsevier