Size of Quantum Finite State Transducers

Authors:
Ruben Agadzanyan;Rūsiņš Freivalds
Affiliations:
Institute of Mathematics and Computer Science, University of Latvia, Raiņa bulv. 29, Rīga, Latvia;Institute of Mathematics and Computer Science, University of Latvia, Raiņa bulv. 29, Rīga, Latvia
Venue:
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Year:
2007

Citing 5
Cited 0

Undecidability on quantum finite automata

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
An Introduction to the Theory of Computation

An Introduction to the Theory of Computation
Quantum Finite State Transducers

SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
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

Sizes of quantum and deterministic finite state transducers are compared in the case when both quantum and deterministic finite state transducers exist. The difference in size may be exponential.