K+1 Heads are Better Than K

Yao, Andrew C.; Rivest, Ronald L.

K+1 Heads are Better Than K

Download

Name

MIT-LCS-TM-075.pdf

Size

2.61 MB

Format

Adobe PDF

Checksum (MD5)

710e88080541cac3939b90e07858042c

Author(s)

Yao, Andrew C.

•

Rivest, Ronald L.

Date Issued

September 1976

Series/Report no.

MIT-LCS-TM-075

Abstract

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.

Persistent DSpace Link

https://hdl.handle.net/1721.1/148903