1,770 research outputs found
Two-tape finite automata with quantum and classical states
{\it Two-way finite automata with quantum and classical states} (2QCFA) were
introduced by Ambainis and Watrous, and {\it two-way two-tape deterministic
finite automata} (2TFA) were introduced by Rabin and Scott. In this paper we
study 2TFA and propose a new computing model called {\it two-way two-tape
finite automata with quantum and classical states} (2TQCFA). First, we give
efficient 2TFA algorithms for recognizing languages which can be recognized by
2QCFA. Second, we give efficient 2TQCFA algorithms to recognize several
languages whose status vis-a-vis 2QCFA have been posed as open questions, such
as . Third, we show that
can be recognized by {\it -tape
deterministic finite automata} (TFA). Finally, we introduce {\it
-tape automata with quantum and classical states} (TQCFA) and prove that
can be recognized by TQCFA.Comment: 25 page
- β¦