k + 1 Heads Are Better than k

Journal of the ACM (JACM)

Volumn 25, Issue 2, 1978, Pages 337-340

  Yao, Andrew C ^a,b   Rivest, Ronald L ^a,c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b STANFORD UNIVERSITY   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976716510     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/322063.322076     Document Type: Article

References (9)

1. Floyd, R W Review 14, 352.
2. Comptng Rev. 9, 5 (May 1968), 280.
3. Ibarra, O H., and Kim, C E On 3-head versus 2-head finite automata. Acta Informatica 4 (1975), 193-200.
4. Nelson, C G One-way automata on bounded languages Tech. Rep TR14-76, Harvard Ctr for Res and Comptng, July 1976.
5. Piatkowski, T F N-head finite state machines Ph D Th., U of Michigan, Ann Arbor, Mich, 1963.
6. Rosenberg, A L On multihead finite automata IBM J Res. and Develop 10 (1966), 388-394.
7. Rosenberg, A L Nonwriting extensions of finite automata Ph D Th, Rep No. BL-39, Comput Lab, Harvard U., Cambridge, Mass, 1965.
8. Sudborough, I H One-way multihead writing finite automata Inform, and Control 30 (1976), 1-20.
9. Sudborough, I H Computation by multi-head writing finite automata Ph. D Th, Pennsylvania State U, University Park, Pa, 1971.