量子下推自动机
Quantum Pushdown Automata
摘要：
量子有限自动机和量子下推自动机（QPA）是由C.摩尔和J. P.克拉奇菲尔德。本文利用Kondacs和Watrous的量子有限自动机的定义，以一种非等价的方式引入了QPA的概念，包括么正性准则。证明了QPA的么正性判据与量子图灵机的么正性判据不等价。我们证明了QPA可以识别每一种常规语言。最后，我们给出了一些可以被QPA识别、但不能被确定性下推自动机识别的简单语言。
英文摘要：
Quantum finite automata, as well as quantum pushdown automata (QPA) were first introduced by C. Moore and J. P. Crutchfield. In this paper we introduce the notion of QPA in a non-equivalent way, including unitarity criteria, by using the definition of quantum finite automata of Kondacs and Watrous. It is established that the unitarity criteria of QPA are not equivalent to the corresponding unitarity criteria of quantum Turing machines. We show that QPA can recognize every regular language. Finally we present some simple languages recognized by QPA, not recognizable by deterministic pushdown automata.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
