Exclusive affine languages

BALTIC JOURNAL OF MODERN COMPUTING（2022）

引用 0|浏览2

暂无评分

摘要

We present two fundamental results about the computational power of affine finite automata (AfAs). First, we show that changing the cutpoints does not change the class of lan-guages defined by AfAs. Second, we show that AfAs define more languages than probabilistic and quantum finite automata with exclusive cutpoints.

查看译文

关键词

Affine automata, exclusive languages, cutpoints, probabilistic automata, quantum automata

AI 理解论文

溯源树

样例

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

Chat Paper

正在生成论文摘要