Finite state machine for mutation
Dipankar Mazumdar, Swapan Raha · 2008
Abstract: In this paper an attempt has been made to represent biological mutational activities through sequential mathematical machines. Begin with a brief theory of finite state sequential machines genetic sequences are presented in a systematic manner. A mutator has been shown as a variety of finite state machines. The mutation is studied systematically and an automaton have been constructed with the biological sequences. It has also been shown that the automaton constructed is the minimal state automaton. DNA sequences are represented as regular expressions. A case study with FMR-1 gene is presented as an illustration.