String matching with simple devices

https://doi.org/10.1016/j.ipl.2007.07.011Get rights and content

Abstract

With the help of a general simulation technique of deterministic finite two-way multi-head automata by automata with blind heads we show O(n2/logn) to be an upper time bound on string matching. This result is tight by a previously known lower bound.

References (11)

There are more references available in the full text version of this article.

Cited by (0)

View full text