String-matching cannot be done by a two-head one-way deterministic finite automation
Information Processing Letters
Tape versus queue and stacks: the lower bounds
Information and Computation
A fast string searching algorithm
Communications of the ACM
Time-space-optimal string matching (Preliminary Report)
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Three applications of Kolmogorov-complexity
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
String matching with simple devices
Information Processing Letters
| Hi-index | 0.00 |
We prove that three-head one-way DFA cannot perform string matching, that is, no three-head one-way DFA accepts the language L = {x # y|x is a substring of y, where x, y @e {0, 1}*}. This answers the k = 3 case of the question whether a k-head one-way DFA can perform string matching, raised by Galil and Seiferas