Quantum Finite State Transducers

Details Quantum Finite State Transducers Quantum Finite State Transducers

2000-11-13

arxiv.org/abs/quant-ph/0011052v2

Proc. SOFSEM 2001, pp. 233--242, Springer, Berlin 2001.

Physics

Quantum Physics

LaTeX2e, 14 pages, short version to appear in Proc. SOFSEM 2001. Requires cl2emult.cls and some packages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Quantum Finite State Transducers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum Finite State Transducers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Finite State Transducers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-381109