On improving the worst case running time of the Boyer-Moore string matching algorithm
Communications of the ACM
A fast string searching algorithm
Communications of the ACM
STOC '81 Proceedings of the thirteenth 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
Efficient randomized pattern-matching algorithms
IBM Journal of Research and Development - Mathematics and computing
External Memory Algorithms for String Problems
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
Succinct 2D dictionary matching with no slowdown
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Optimal pattern matching in LZW compressed strings
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
External Memory Algorithms for String Problems
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
Simple and efficient LZW-Compressed multiple pattern matching
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Simple and efficient LZW-compressed multiple pattern matching
Journal of Discrete Algorithms
| Hi-index | 0.00 |
In this paper we describe a new linear-time string-matching algorithm requiring neither dynamic storage allocation nor other high-level capabilities. The algorithm can be implemented to run in linear time even on a six-head two-way finite automaton. Moreover, the automaton requires only “{&equil; @@@@}- branching” [1]. (Decisions depend on which of the six scanned pattern or text symbols and positions are the same, but not on the particular symbols or how many symbols there are. Hence the same algorithm works even for an infinite alphabet.) A “real-time” implementation is possible on such a multihead finite automaton with a few more heads.