String-matching cannot be done by a two-head one-way deterministic finite automation

Algorithms for string searching

ACM SIGIR Forum

A lower bound for parallel string matching

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing

k one-way heads cannot do string-matching

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing

Three one-way heads cannot do string matching

Journal of Computer and System Sciences

String matching with simple devices

Information Processing Letters

One-reversal counter machines and multihead automata: revisited

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science

One-reversal counter machines and multihead automata: Revisited

Theoretical Computer Science