Size lower bounds for quantum automata.

Maria Paola Bianchi,Carlo Mereghetti,Beatrice Palano

Theoretical Computer Science（2014）

引用 10|浏览12

暂无评分

摘要

•We analyze the descriptional power of Quantum Finite Automata with control language.•We show an exponential size cost conversion from QFAs with control language to DFAs.•We simulate Latvian QFAs by QFAs with control languages.•We obtain size lower bounds for several models of QFAs.

查看译文

关键词

Quantum finite automata,Descriptional complexity

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要