One-Way reversible and quantum finite automata with advice

Authors:
Tomoyuki Yamakami
Affiliations:
Department of Information Science, University of Fukui, Fukui, Japan
Venue:
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Year:
2012

Citing 7
Cited 0

Characterizations of 1-Way Quantum Finite Automata

SIAM Journal on Computing
On the power of quantum finite state automata

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
1-way quantum finite automata: strengths, weaknesses and generalizations

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Polynomial time quantum computation with advice

Information Processing Letters
Quantum versus deterministic counter automata

Theoretical 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 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.