Mazumdar, D.; Raha, S. Finite state machine for mutation. (English) Zbl 1152.68460 Adv. Model. Optim. 10, No. 2, 241-265 (2008). Summary: An attempt has been made to represent biological mutational activities through sequential mathematical machines. Beginning 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 a minimal state automaton. DNA sequences are represented as regular expressions. A case study with FMR-I gene is presented as an illustration. Cited in 1 Document MSC: 68Q45 Formal languages and automata 92D10 Genetics and epigenetics 92D20 Protein sequences, DNA sequences Keywords:biological mutational activities; sequential mathematical machines PDFBibTeX XMLCite \textit{D. Mazumdar} and \textit{S. Raha}, Adv. Model. Optim. 10, No. 2, 241--265 (2008; Zbl 1152.68460) Full Text: Link