Skip to main content
Article thumbnail
Location of Repository

Two-tape finite automata with quantum and classical states

By Shenggen Zheng, Lvzhou Li and Daowen Qiu

Abstract

{\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 $L_{square}=\{a^{n}b^{n^{2}}\mid n\in \mathbf{N}\}$. Third, we show that $\{a^{n}b^{n^{k}}\mid n\in \mathbf{N}\}$ can be recognized by {\it $(k+1)$-tape deterministic finite automata} ($(k+1)$TFA). Finally, we introduce {\it $k$-tape automata with quantum and classical states} ($k$TQCFA) and prove that $\{a^{n}b^{n^{k}}\mid n\in \mathbf{N}\}$ can be recognized by $k$TQCFA.Comment: 25 page

Topics: Quantum Physics
Year: 2011
DOI identifier: 10.1007/s10773-010-0582-0
OAI identifier: oai:arXiv.org:1104.3634
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://arxiv.org/abs/1104.3634 (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.