Characterizations of quantum automata

  • Authors:

  • Daowen Qiu;Mingsheng Ying

  • Affiliations:

  • Department of Computer Science, Zhongshan University, Guangzhou 510275, PRC and State Key Laboratory of Intelligent Technology and Systems, Dept. of Comp. Sci. and Technol., Tsinghua Univ., Beijin ...;State Key Laboratory of Intelligent Technology and Systems, Department of Computer Science and Technology, Tsinghua University, Beijing 100084, People's Republic of China

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2004

Quantified Score

Hi-index 5.23

Visualization

Abstract

We define q quantum finite automata (qQFAs) and q quantum regular grammars (qQRGs), and verify that they are exactly equivalent to those measure-once quantum finite automata (MO-QFAs) in the literature. In particular, we define q quantum pushdown automata (qQPDAs) and QPDAs that are at least as powerful as those defined by Moore and Crutchfield, and especially we focus on demonstrating the equivalence between qQPDAs and QPDAs. Also, we discuss some of the properties of languages accepted by qQPDAs; for example, every cut-point language accepted by qQPDA is independent of the cut-point