Author(s) :   Dr. Asoke Nath¹, Priyanshu Acharya²

Abstract : This paper presents a computational method that can be used to convert a given Non-Deterministic Finite State Automata (NFA) to a Deterministic Finite State Automata (DFA). Different classes of automata are used because it is often seen that one kind of automaton can achieve something that other cannot. However, DFA and NFA are equally powerful but DFA is often preferred for scientific operations. The same computational method is applied to long DNA for sequence matching. A given DNA Sequence is passed through a DFA to check for the presence of a required matching sequence. This makes it useful in the fields where large volumes of DNA are to be scanned to check for the presence of any given pattern, and it will also help in checking for mutated DNA and the presence or absence of any genetic disease in the sequence.

Keywords: Non-Deterministic Finite Automata, Deterministic Finite Automata, DNA Sequence Matching, Nitrogenous Bases, Python.

DOI : 10.61161/ijarcsms.v11i11.2

Pages : 10-20

*Authors are invited to submit papers through E-mail at editor.ijarcsms@gmail.com