New techniques for obtaining lower bounds on string-matching problems are developed and we prove the following new results. String-matching cannot be performed by a three-head one-way deterministic finite automaton. This answers the $k=3$ case of the open question, due to Galil and Seiferas [GS], whether a $k$-head one-way deterministic finite automaton can perform string-matching. String-matching by a k-head two-way DFA with k-1 heads blind (can only see two end symbols) is studied, tight upper and lower bounds are provided. Probabilistically moving a string on one tape (requiring $n^{2}$ time) is harder than probabilistically matching two strings on 1 tape. Notice that this is not true for deterministic or even nondeterministic TMs. This is the first result showing that checking is easier than generating.
Cited By
Recommendations
Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata
Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures - Volume 5504The nonemptiness problem for nondeterministic automata on infinite words can be reduced to a sequence of reachability queries. The length of a shortest witness to the nonemptiness is then polynomial in the automaton. Nonemptiness algorithms for ...
Tight Lower Bounds on the Size of Sweeping Automata
A sweeping automaton is a two-way deterministic finite automaton which makes turns only at the endmarkers. We say that a sweeping automaton is degenerate if the automaton has no left-moving transitions. We show that for each positive integer n, there is ...