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 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; also, 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 Î {a,b}^*,#_x(a)=#_x(b)}\{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.