Hierarchies of turing machines with restricted tape alphabet size

Authors:
Oscar H. Ibarra;Sartaj K. Sahni
Affiliations:
-;-
Venue:
Journal of Computer and System Sciences
Year:
1975

Citing 2
Cited 1

Formal languages and their relation to automata

Formal languages and their relation to automata
Hierarchies of memory limited computations

FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)

Hierarchies of DLOGTIME-uniform circuits

MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality

Quantified Score

Hi-index	0.01

Visualization

Abstract

It is shown that for any real constants ba=0, multitape Turing machines operating in space L"1(n)=[bn^r] can accept more sets than those operating in space L"2(n)=[an^r] provided the number of work tapes and tape alphabet size are held fixed. It is also shown that Turing machines with k+1 work tapes are more powerful than those with k work tapes if the tape alphabet size and the amount of work space are held constant.