K+1 Heads are Better Than K
Author(s)
Yao, Andrew C.; Rivest, Ronald L.
DownloadMIT-LCS-TM-075.pdf (2.606Mb)
Metadata
Show full item recordAbstract
There are languages which can be recognized by a deterministic (k+1)-headed one-way finite automaton but which cannot be recognized by a k-headed one-way (deterministic or non-deterministic) finite automaton. Furthermore, there is a language accepted by a 2-headed nondeterministic finite automaton which is accepted by no k-headed deterministic finite automaton.
Date issued
1976-09Series/Report no.
MIT-LCS-TM-075