Linear-Time String-Matching Using only a Fixed Number of Local Storage Locations

@article{Galil1981LinearTimeSU,
  title={Linear-Time String-Matching Using only a Fixed Number of Local Storage Locations},
  author={Zvi Galil and Joel I. Seiferas},
  journal={Theor. Comput. Sci.},
  year={1981},
  volume={13},
  pages={331-336}
}
We report a linear-time string-matching algorithm for a random-access machine without dynamic storage allocation. To do this, we tell how to adapt a cited algorithm to fill its dynamic storage needs by temporarily borrowing some of the space occupied by the input pattern. In automata-theoretic terms, we tell how to adapt the cited algorithm to run on a writing multihead finite automaton with a restricted writing alphabet.