A finite-state machine (FSM) is an abstract mathematical model of computation used to design both computer programs and sequential logic circuits. Considered as an abstract model of computation, FSM is weak; it has less computational power than some other models of computation such as the Turing machine. This paper discusses the finite-state automata based on Deoxyribonucleic Acid (DNA) and different implementations of DNA FSMs. Moreover, a comparison was made to clarify the advantages and disadvantages of each kind of presented DNA FSMS. Since it is a major goal for nanoscince, nanotechnology and super molecular chemistry is to design synthetic molecular devices that are programmable and run autonomously. Programmable means that the behavior of the device can be modified without redesigning the whole structure. Autonomous means that it runs without externally mediated change to the work cycle. In this paper we present an odd Parity Checker Prototype Using DNAzyme FSM. Our paper makes use of a known design for a DNA nanorobotic device due to Reif and Sahu  for executing FSM computations using DNAzymes. The main contribution of our paper is a description of how to program that device to do a FSM computation known as Odd Parity Checking. We describe in detail finite state automaton built on 10-23 DNAzyme, and give its procedure of design and computation. The design procedure has two major phases: designing the language potential alphabet DNA strands, and depending on the first phase to design the DNAzyme possible transitions.
Restriction enzymes, Finite state automata, DNA computing, DNAzymes
Ayman El-Sayed, "An Odd Parity Checker Prototype Using DNAzyme Finite State Machine", IEEE/ACM Transactions on Computational Biology and Bioinformatics, , no. 1, pp. 1, PrePrints PrePrints, doi:10.1109/TCBB.2013.2295803