Abstract: A DNA algorithm based on finite automaton to the Hamilton path problem is presented in this article.The states of the finite automaton are encoded by double strands which all comprises different recognition sites.The transition is represented by a double strand with segment encoding for the current state and another segment encoding the next state.The innovation of the paper is that it keeps the states that finite automaton run.The advantage of this method is it can efficiently reduce the amount of DNA molecule.