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
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
Some definitional suggestions for automata theory
Journal of Computer and System Sciences
Quantum versus deterministic counter automata
Theoretical Computer Science
Size of Quantum Finite State Transducers
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Computation in Sofic Quantum Dynamical Systems
Natural Computing: an international journal
Quantum computation with devices whose contents are never read
UC'10 Proceedings of the 9th international conference on Unconventional computation
Quantum computation with write-only memory
Natural Computing: an international journal
On learning finite-state quantum sources
Quantum Information & Computation
Computation in sofic quantum dynamical systems
UC'07 Proceedings of the 6th international conference on Unconventional Computation
| Hi-index | 0.00 |
We introduce quantum finite state transducers (qfst), and study the class of relations which they compute. It turns out that they share many features with probabilistic finite state transducers, especially regarding undecidability of emptiness (at least for low probability of success). However, like their 'little brothers', the quantum finite automata, the power of qfst is incomparable to that of their probabilistic counterpart. This we show by discussing a number of characteristic examples.