一种DNA计算系统的有限自动机模型

Finite automata model for one type of DNA computing system

通过一个实例给出了粘贴系统模型的基本定义,讨论了粘贴系统模型的正则文法特性,并从自动机的角度给出了相当于正则文法表达能力的有限自动机模型.

Sticker system model,as one of the important DNA computing model,simulates the sticking operation of DNA molecular.Here some basic definitions about sticker system model are presented with an example,and a discussion about its regular grammar characteristic is made briefly,then a finite automata model that is equivalent to the regular grammar model is put forward.