The intuition is that I w reads a string In more detail, for each i (1 ≤ i ≤ n) and each a ∈ Σ, there is a transition t i−1 a → t j , where j is the length of the longest string that is both a prefix of w and a suffix of a 1 • • • a i−1 a.
the systems of equations for C 1 and C 3 change fundamentally if the infix is extended by one more symbol, which seems to at least make incremental computation very difficult, if not impossible.