Showing papers on "Approximate string matching published in 1979"

On improving the worst case running time of the Boyer-Moore string matching algorithm

Abstract: It is shown how to modify the Boyer-Moore string matching algorithm so that its worst case running time is linear even when multiple occurrences of the pattern are present in the text.

A note on pattern matching: Where do you find the match to an empty array?

Abstract: The question in the title is answered, and the answer justified by a derivation and use in two applications, string partitioning and string editing. Some implications for APL language extensions are also noted.