Probabilities to accept languages by quantum finite automata

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

14 pages, to appear in COCOON'99

Scientific paper

We construct a hierarchy of regular languages such that the current language
in the hierarchy can be accepted by 1-way quantum finite automata with a
probability smaller than the corresponding probability for the preceding
language in the hierarchy. These probabilities converge to 1/2.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Probabilities to accept languages by quantum finite automata 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 Probabilities to accept languages by quantum finite automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Probabilities to accept languages by quantum finite automata will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-309788

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.