DNA algorithm of primeness test based on finite automaton
Finite automaton,a computational model of extremely limited computing ability,was proved to have the capa-bility of solving primeness test by construction.Then,a DNA algorithm of the primeness test based on finite automaton was proposed.Furthermore,the method of constructing the finite automaton was...
Saved in:
Main Authors: | YANG Xue-qing, LIU Zhong-kan |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Journal on Communications
2006-01-01
|
Series: | Tongxin xuebao |
Subjects: | |
Online Access: | http://www.joconline.com.cn/zh/article/74659930/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Finite automaton intrusion tolerance system model based on Markov
by: Zhiyong LUO, et al.
Published: (2019-10-01) -
Multiscale approach to description of deformation and fracture of brittle media with hierarchical porous structure on the basis of movable cellular automaton method
by: Ig. S. Konovalenko, et al.
Published: (2013-03-01) -
Research on cryptographic properties of a new S-box based on cellular automaton
by: Jie GUAN, et al.
Published: (2019-05-01) -
A Modified Key Generation Algorithm to Rebalanced-RSA and RPower-RSA
by: İsrafil Okumuş, et al.
Published: (2024-12-01) -
WSN malware infection model based on cellular automaton and static Bayesian game
by: Hong ZHANG, et al.
Published: (2019-06-01)