The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata (Extended Abstract)

Authors:
Tomoyuki Yamakami
Affiliations:
Department of Information Science, University of Fukui, Fukui, Japan 910-8507
Venue:
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Year:
2009

Citing 5
Cited 0

On the structure of one-tape nondeterministic Turing machine time hierarchy

Theoretical Computer Science
Automata That Take Advice

MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Probabilistic computations: Toward a unified measure of complexity

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Theory of one-tape linear-time Turing machines

Theoretical Computer Science
Immunity and pseudorandomness of context-free languages

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We discuss the power and limitations of various "advice," when it is given particularly to weak computational models of one-tape two-way linear-time Turing machines and one-way finite (state) automata. Of various advice types, we consider deterministically-chosen advice, which is selected depending only on input size, and randomly-chosen advice, which is chosen according to certain probability distributions. We show that machines can be significantly enhanced in computational power when advice is provided; on the contrary, there are clear limitations on such a power.