Abstract 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, the finite state machine is weak; it has less computational power than some other models of computation such as the Turing machine. This paper overview the finite-state automata based on Deoxyribonucleic Acid (DNA). Such automata uses massive parallel processing offered by molecular approach for computation and exhibits a number of advantages over traditional electronic implementations
