Formulas for the numbers of sequences containing a given pattern given number of times
Александр Александрович Серов · Discrete Mathematics and Applications · 2022
Abstract Explicit recurrent formulas for the numbers of sequences containing a given pattern given number of times are constructed. These formulas depend on the length of the sequence, the length of the pattern and its period only. By means of these results one may find the distribution of statistics of the NIST overlapping matching test for binary sequences and arbitrary pattern parameters.