On hybrid models of quantum finite automata

作者：

Highlights：

• This paper describes several existing hybrid models of QFA in a uniform way.

• We clarify the relationship between hybrid QFA and some other models.

• Some results concerning the language recognition power and the equivalence problem of hybrid QFA follow directly in this paper.

摘要

•This paper describes several existing hybrid models of QFA in a uniform way.•We clarify the relationship between hybrid QFA and some other models.•Some results concerning the language recognition power and the equivalence problem of hybrid QFA follow directly in this paper.

论文关键词：Quantum computing,Automata theory,Quantum finite automata,Hybrid model of QFA

论文评审过程：Received 28 May 2014, Revised 3 November 2014, Accepted 27 January 2015, Available online 18 February 2015, Version of Record 10 June 2015.

论文官网地址：https://doi.org/10.1016/j.jcss.2015.01.001