The Complexity of Probabilistic versus Quantum Finite Automata

Authors:
Gatis Midrijanis
Affiliations:
-
Venue:
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Year:
2002

Citing 3
Cited 0

The Complexity of Probabilistic versus Deterministic Finite Automata

ISAAC '96 Proceedings of the 7th International Symposium on Algorithms and Computation
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a language Ln which is recognizable by a probabilistic finite automaton (PFA) with probability 1 - 驴 for all 驴 0 with O(log2 n) states, with a deterministic finite automaton (DFA) with O(n) states, but a quantum finite automaton (QFA) needs at least 2驴(n/log n) states.