NOTE: This transcription was contributed by Martin P.M. van der Burgt, who has devised a process for producing transcripts automatically. Although its markup is incomplete, we believe it serves a useful purpose by virtue of its searchability and its accessibility to text-reading software. It will be replaced by a fully marked-up version when time permits. —HR

(To be inserted after EWD437).

The pattern matching problem.

The problem that is solved in this chapter is a very famous one, that has been tackled independently by many programmers. Yet we hope that our treatment gives some pleasure to even those of my readers who considered themselves thoroughly familiar with the problem and its various solutions.

We consider as given two sequences of values

 p(0), p(1), , p(N -1)      with N ≥ 1      and x(0), x(1), , x(M -1)      with M ≥ 0
(usually M is regarded as being many times larger than N). The question to be answered is: how many times occurs the “pattern”, as given by the first sequence, in the second sequence?
 Using (N i: 0 ≤ i < m: B(i))
to denote “the number of different values of i in the range 0 ≤ i < m , for which B(i) holds”, a more-precise description of the final relation R that is to be established is
 R: count = (N i: 0 ≤ i ≤ M - N: match(i))
where the function match(i) is given by
 for 0 ≤ i ≤ M - N: match(i) = (A j: 0 ≤ j M - N: match(i) = false .
(To define match(i) = false for those further values of i , thus making it a total function, is a matter of convenience.)

If we take as invariant relation

 P1: count = (N i: 0 ≤ i < r: match(i)) and r ≥ 0
we have one which is trivially established by “count, r:= 0, 0” and, furthermore, is such that
 (P1 and r > M - N) ⇒ R .
(The “matter of convenience” referred to above is that now the above inequality will do the job.) This gives a sketch for the program:
 count, r:= 0, 0; do r ≤ M - N → “increase r under invariance of P1 ” od
and the reader is invited to work out for himself the refinement in which r is always increased by 1; worst case the time taken by the execution of that program will be proportional to M * N .

Depending on the pattern,however, much larger increases of r seem sometimes possible: if, for instance, the pattern is (1, 2, 3, 4, 5) and match(r) has been found to hold, “count, r:= count + 1, r + 5” would leave P1 invariant! Considering the invariant relation

 P2: (A ≤ j < k: p(j) = x(r + j)) and 0 ≤ k ≤ N
(which can be expected to play a role in the repetitive construct computing match(r)), we can investigate, what we can gain by taking that relation outside the repetitive construct, i.e, we consider:
 count, r, k:= 0, 0, 0; do r ≤ M - N → “increase r under invariance of P1 and P2 ” od
(relation P2 being vacuously satisfied by k = 0 ).

In view of the validity of relation P2 and the formula for match(r), the most natural thing to start the repeatable statement with is to try to determine match(r) : as the truth of match(r) can be concluded from P2 and k = N we prescribe that k be increased as long as is necessary and possible:

 do k = N cand p(k) = x(r+k) → k:= k + 1 od (1)
upon termination of which —and termination is guaranteed— we have
 P2 and (k = N cor p(k) ≠ x(r + k))
from which we can conclude that match(r) = (k = N) . Thus it is known, whether increasing r by 1 should be accompanied by “count:= count + 1” or not. We would like to know, by how much r can be increased without further increase of count and without taking any further x-values into account. (The taking into account of x-values is done in statement (1): to do so is its specific purpose! Here we are willing to exploit only properties of the —constant— pattern;)

If k = 0, we conclude (because N > 0 ) that match(r) = false : the relation Pl then justifies an increase of r by 1 —leaving P1 invariant by leaving count unchanged— but P2 does not justify any higher increase of r ; and k = 0 —making P2 vacuously true— is maintained.

For general k , however, there is the following argument. Define for 0 < i ≤ k ≤ N the boolean function

 dif(i, k) = (E j: 0 ≤ j < k - i; p(j) ≠ p(i + j)) .
From this it follows that dif(k, k) = false . If, however, dif(i, k) = true, (we conclude —because 0 ≤ i + j < k— on account of the truth of P2
 (E j: 0 ≤ j < k - i: p(j) ≠ x(r + i + j)) .
that is: dif(i, k) ⇒ non match(r + i) . Therefore, the variable “count” needs no further adjustments —besides the one on account of the value of match(r)— when r is increased by d(k), where d(k) is the minimum solution for i with 0 < i ≤ k of the equation dif(i, k) = false , or:
 (A j:0 ≤ j < k - i: p(j) = p(i + j)) . (2)

The fact that d(k) is a solution of (2) implies

 (A j:0 ≤ j < k - d(k): p(j) = p(d(k) + j)) .
which, with P2 amounts to
 (A j:0 ≤ j < k - d(k): p(j) = x(r + d(k) + j)) .
and as a result —besides the adjustment of “count” as implied by the value of match(r) —both P1 and P2 are kept invariant by “r, kt: r + d(k), k - d(k)”.

Because the minimum solution of (2) depends on k and p only, we find:

 begin glocon p, N, x, M; virvar count; privar r, k; pricon d; . “initialize d”; count, r, k := 0, 0, 0; 3 * vir int do r ≤ M - N → do k ≠ N cand p(k) = x(r + k) → k:= k + l od; if k = N → count:= count + l; r, k := r + d(k), k - d(k) ▯ 0 < k < N → r, k := r + d(k) , k - d(k) ▯ k = 0 → r:= r + 1 fi od end

The only job left is the initialization of the array variable d , i.e. to establish for each k satisfying 1≤ k ≤ N the minimum solution for i of (2) . The Linear Search Theorem tells us that we should try i-values in increasing order. It pays, however, to realize that this minimum value for i has to be determined for a whole sequence of k-values. Let k1 > k2 and let d(k1) be the minimum solution for i of (2) with k = k1 . From

 (A j:0 ≤ j < k1 - d(k1): p(j) = p(d(k1) + j)) and k1 > k2
follows:
 (A j:0 ≤ j < k2 - d(k1): p(j) = p(d(k1) + j))
i.e. for k = k2 , d(k1) is also a solution for i of (2) , but not necessarily the smallest! From that we conclude that d(k) is a monotonically non-decreasing function of k. And the algorithm therefore investigates increasing values of i , each time deciding whether for one or more k-values i = d(k) can be concluded (should be established). More precisely: let j(i) (for given value of i be the maximum value ≤ N - i , such that
 (A j: 0 ≤ j
then d(k) = i for all k such that k - i ≤ j(i) (or: k ≤ j(i)+ i), for which no solution d(k) < i exists. As the values of i will be tried in increasing order and, as soon as existing as minimal solution, will be recorded in the monotonically non-decreasing function d , the condition is
 d.hib < k ≤ j(i)+ i
and we get the following program:
 “initialize d”: begin glocon p, N; virvar d; privar i; d vir int array, i vir int := (1), 0; do d.hib ≠ N → begin glocon p, N; glovar d, i; privar j; j vir int := 0; i:= i + 1; do j < N - i cand p(j) = p(i + j) → j:= j + l od; do d.hib < j + i - d:hiext(i) od end od end

Exercise 1. Give a formal correctness proof for the above initialization. (End of exercise 1.)

Exercise 2. With “r, k := r + d(k), r - d(k)” For 0 < k , our algorithm adjusts r and k without changing r + k . Investigate the slight gain that is possible for 0 < k < N if it is known that the x-values are two-valued. (End of exercise 2.)

Remark. Our final algorithm is one, the execution time of which I regard as to grow proportional to, M + N . Once one has set oneself the goal to find —if possible— an algorithm with such a performance, its actual development. does not seem to require much more than the usual care; the crucial point seems the refusal to be satisfied (without further investigation) with the obvious M * N -algorithm, the development of which I have left as an exercise to the reader. A slight reformulation of the problem, however, enables us to recognize also here a general design principle, which might be called “The Search for the Small Superset.” Suppose that we had not been asked to count the number of matches, but to generate the sequence of r-values, for which match(r) holds.

When a program has to generate the members of a set A , there are (roughly) only two situations. Either we have simple, straightforward “successor function” by means of which a next member of A can be generated —and then the whole set can be trivially generated by means of repeated application of that successor function— or we do not have a function like that. In the latter case, the usual technique is to generate the members of a set B instead, where
a)     each member of A is a member of B as well
b)     there exists a generator for successive members of B
c)     there exists a test whether a member of B belongs to A as well. The algorithm then generates and inspects all members of B in turn.

If this technique is to lead to a satisfactory performance, three conditions should be satisfied:
1)     the members of set B should be reasonably efficient to generate
2)     the test whether an element of B belongs to A as well —particularly in the case that it does not, for, usually, B is an order of magnitude larger than A — should be reasonably efficient
3)     set B should not be unnecessarily large.

The trained problem solver, aware of the above, will consciously look for a smaller set B than the obvious one. In this example, the set of all r-values satisfying 0 ≤ r ≤ M - N is the obvious one. Note, that in the previous chapter “An exercise attributed to R.W.Hamming” the replacement of the set “qq” by the much smaller set “qqq” was another application of the principle of The Search for the Small Superset. And besides “taking a relation outside the repetitive construct” this illustrates the second strategical similarity between the solutions presented in the current and in the previous chapter. (End of remark.)

Transcribed by Martin P.M. van der Burgt
Last revision 2014-11-15 .