String matching with simple devices

Authors:
Holger Petersen
Affiliations:
Universität Stuttgart, FMI, Universitätsstr. 38, D-70569 Stuttgart, Germany
Venue:
Information Processing Letters
Year:
2008

Citing 8
Cited 0

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

Information Processing Letters
Two-way string-matching

Journal of the ACM (JACM)
String-matching on ordered alphabets

Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
Three one-way heads cannot do string matching

Journal of Computer and System Sciences
The zooming method: a recursive approach to time-space efficient string-matching

Theoretical Computer Science
k one-way heads cannot do string-matching

Journal of Computer and System Sciences
On maximal suffixes and constant-space linear-time versions of KMP algorithm

Theoretical Computer Science
Lower Bounds on String-Matching

Lower Bounds on String-Matching

Quantified Score

Hi-index	0.89

Visualization

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(n^2/logn) to be an upper time bound on string matching. This result is tight by a previously known lower bound.