Vertically Compressed OP tables
Here are some slices of a vertical compression of OP table n = 301:
Gallery 2
From n = 900: From n = 1800, zoomed in: From n = 2401:
Popular posts from this blog
What is an overlap pattern?
An overlap pattern is a binary string that describes how a given character string overlaps shifted copies of itself. For example, consider the string "abc". Its overlap pattern is "100". For short, op("abc") = "100". Here's another couple of examples: As we see, op("aba") = 101. And op("aabaa") = "10011". For a string s of length n, with characters indexed from 0 to n-1, the kth digit of op(s) = 1 if and only if the first n-k characters of s match its last n-k characters (in order.) Notice that since every string matches itself, every overlap pattern starts with "1". What is an overlap pattern table? There is an OP table for every positive integer. (We can debate whether or how to define one for n = 0.) It consists of every possible overlap pattern of length n, arranged in increasing numeric order. For n = 1, every string s of length 1 has op(s) = "1", so OP table n = 1 consists o...
Comments
Post a Comment