JavaScript is disabled for your browser. Some features of this site may not work without it.
String-Matching Cannot be Done by a Two-Head One-Way Deterministic Finite Automaton

Author
Li, Ming; Yesha, Yaacov
Abstract
We show that string-matching cannot be performed by a two-head one-way deterministic finite automaton (or even by a Turing machine with two one-way input heads and o(n) storage space). Thus we answer the special case $k=2$ of the open question, due to Galil and Seiferas [GS], whether a $k$-head one-way deterministic finite automaton can perform string-matching.
Date Issued
1983-10Publisher
Cornell University
Subject
computer science; technical report
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR83-579
Type
technical report