One-Way Reversible and Quantum Finite Automata with Advice
We examine characteristic features of reversible and quantum computations in the presence of supplementary information, known as advice. In particular, we present a simple, algebraic characterization of languages recognized by one-way reversible finite automata with advice. With a further elaborate argument, a similar but slightly weaker result for bounded-error one-way quantum finite automata is also proven. As an immediate application of those features, we demonstrate certain containments and separations among various standard language families that are suitably assisted by advice.
KeywordsReversible Finite Automaton Quantum Finite Automaton Advice Regular Language Context-free Language
Unable to display preview. Download preview PDF.
- 1.Ambainis, A., Freivalds, R.: 1-way quantum finite automata: strengths, weaknesses, and generalizations. In: FOCS 1998, pp. 332–342 (1998)Google Scholar
- 4.Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: FOCS 1997, pp. 66–75 (1997)Google Scholar
- 7.Yamakami, T.: Swapping lemmas for regular and context-free languages (2008), arXiv:0808.4122Google Scholar