“…Following the previously discussion, the repeating patterns of length 1, 2, 4 do exist, though RP [8]=∅, where RP[x] denotes the set of repeating patterns with length equal to x. To determine L (and the corresponding maximum-length repeating patterns), we consider that k l = 3, since 8 = 2 3 ; whereas k l−1 = 2, since 4 = 2 2 and RP [4] [5] contains only one such pattern). The result of the first stage of HLC is illustrated in Fig.…”