Physics – Quantum Physics
Scientific paper
2007-01-26
Lecture Notes in Computer Science, vol. 5226, pp.1-8, 2008.
Physics
Quantum Physics
Comments and suggestions are welcome
Scientific paper
{\it Two-way finite automata with quantum and classical states} (2qcfa's) were introduced by Ambainis and Watrous. Though this computing model is more restricted than the usual {\it two-way quantum finite automata} (2qfa's) first proposed by Kondacs and Watrous, it is still more powerful than the classical counterpart. In this note, we focus on dealing with the operation properties of 2qcfa's. We prove that the Boolean operations (intersection, union, and complement) and the reversal operation of the class of languages recognized by 2qcfa's with error probabilities are closed; as well, we verify that the catenation operation of such class of languages is closed under certain restricted condition. The numbers of states of these 2qcfa's for the above operations are presented. Some examples are included, and $\{xx^{R}|x\in \{a,b\}^{*},#_{x}(a)=#_{x}(b)\}$ is shown to be recognized by 2qcfa with one-sided error probability, where $x^{R}$ is the reversal of $x$, and $#_{x}(a)$ denotes the $a$'s number in string $x$.
No associations
LandOfFree
Some observations on two-way finite automata with quantum and classical states 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 Some observations on two-way finite automata with quantum and classical states, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some observations on two-way finite automata with quantum and classical states will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-568601