Finite Automata with Advice Tapes
We define a model of advised computation by finite automata where the advice is provided on a separate tape. We consider several variants of the model where the advice is deterministic or randomized, the input tape head is allowed real-time, one-way, or two-way access, and the automaton is classical or quantum. We prove several separation results among these variants, and establish the relationships between this model and the previously studied ways of providing advice to finite automata.
Keywordsadvised computation finite automata random advice
Unable to display preview. Download preview PDF.
- 6.Yamakami, T.: Swapping lemmas for regular and context-free languages with advice. Computing Research Repository abs/0808.4 (2008)Google Scholar
- 11.Goldreich, O.: Computational Complexity: A Conceptual Perspective. Cambridge University Press (2008)Google Scholar
- 14.Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, FOCS 1997, pp. 66–75 (1997)Google Scholar