Algorithmic classification of noncorrelated binary pattern sequences

Abstract

We show that it is possible to algorithmically verify if a given pattern sequence is noncorrelated. As an application, we compute that there are exactly $2272$ noncorrelated binary pattern sequences of length $\leq 4$. If we restrict our attention to patterns that do not end with $\mathtt{0}$, we put forward a sufficient condition for a pattern sequence to be noncorrelated. We conjecture that this condition is also necessary, and verify this conjecture for lengths $\leq 5$.