• Saroj Kumar
• Dr. Santosh Kumar
• Priya Singh

This paper presents an entirely new technique for calculating and removing dead states, unreachable states and indistinguishable states with unreachable states, dead states and any other states that lead to final state(s). A central problem in Automata theory is to minimize a given Deterministic Finite Automata (DFA). DFA minimization is an important topic that can be applied both theoretically and practically. When there are dead states or unreachable states or indistinguishable states in a DFA, then the time complexity of to minimize the DFA is increases drastically. In DFA, it is not easy to determine dead states, unreachable states and even difficult to identify and remove indistinguishable states when it is attached to the some states that lead to the final state. And removing these useless states from deterministic finite automata is very necessary to generate useful strings. We proposed an algorithm which removes all the useless states that are not involved in the string generation and also remove all the indistinguishable and redundant states. Also if we follow given technique and algorithm, after selecting useful state we can minimize simply of deterministic finite automata.

Automata, Deterministic Finite Automata - DFA, Unreachable State, Dead State, Indistinguishable State, IS-Indistinguishable State, US-Unreachable State, DS-Dead State, DFA-Deterministic Finite Automata

"Elimination of States using State Minimization Approach", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 6, page no.621-629, June 2019, Available :http://www.jetir.org/papers/JETIR1906M93.pdf

"Elimination of States using State Minimization Approach", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 6, page no. pp621-629, June 2019, Available at : http://www.jetir.org/papers/JETIR1906M93.pdf