String matching with simple devices
References (11)
- et al.
Time-space-optimal string matching
Journal of Computer and System Sciences
(1983) String-matching on ordered alphabets
Theoretical Computer Science
(1992)- et al.
The zooming method: a recursive approach to time-space efficient string-matching
Theoretical Computer Science
(1995) On maximal suffixes and constant-space linear-time versions of KMP algorithm
Theoretical Computer Science
(2003)- et al.
String-matching cannot be done by a two-head one-way deterministic finite automaton
Information Processing Letters
(1986)
There are more references available in the full text version of this article.
Cited by (0)
Copyright © 2007 Elsevier B.V. All rights reserved.