有穷自动机，一种计算能力极其有限的计算模型，具有解决素性测试的能力通过构造法得到了证明。
Finite automaton, a computational model of extremely limited computing ability, was proved to have the capability of solving primeness test by construction.
有穷自动机，一种计算能力极其有限的计算模型，具有解决素性测试的能力通过构造法得到了证明。
Finite automaton, a computational model of extremely limited computing ability, was proved to have the capability of solving primeness test by construction.
应用推荐