Minimization of DFA examples using Partition Method or Equivalence Theorem: Minimization of DFA  means reduction of states.If X & Y are two states in a DFA, we can combine these two states into single state {X,Y} if they are not distinguishable i.e. equivalent or indistinguishable. Two states are said to be indistinguishable or equivalent state  if  δ ( X , w)  and  δ (Y, w)  are going to accepting /final states or going to non-accepting /non-final states.It is also called as State minimization. Symbolically this can be represented as 1.        δ ( X , w)    ∈ F and  δ (Y, w)  ∈ F                         OR 2.        δ ( X , w)    ∉ F and  δ (Y, w)  ∉ F Minimization of DFA steps/rules of minimization of DFA in automata: Minimization of DFA questions or  problems  using partition method   can be solved by following steps(How to do minimization of DFA): Step1: Try to delete all the states to which we cannot reach from initial state (unreachable state) Step2: Dra

Minimization of DFA examples using Partition Method or Equivalence Theorem: Minimization of DFA  means reduction of states.If X & Y are two states in a DFA, we can combine these two states into single state {X,Y} if they are not distinguishable i.e. equivalent or indistinguishable. Two states are said to be indistinguishable or equivalent state  if  δ ( X , w)  and  δ (Y, w)  are going to accepting /final states or going to non-accepting /non-final states.It is also called as State minimization. Symbolically this can be represented as 1.        δ ( X , w)    ∈ F and  δ (Y, w)  ∈ F                         OR 2.        δ ( X , w)    ∉ F and  δ (Y, w)  ∉ F Minimization of DFA steps/rules of minimization of DFA in automata: Minimization of DFA questions or  problems  using partition method   can be solved by following steps(How to do minimization of DFA): Step1: Try to delete all the states to which we cannot reach from initial state (unreachable state) Step2: Dra

 Minimization of DFA examples using Partition Method or Equivalence Theorem: Minimization of DFA means reduction of states.If X & Y are two states in a DFA, we can combine these two states into single state {X,Y} if they are not distinguishable i.e. equivalent or indistinguishable. Two states are said to be indistinguishable or equivalent state if δ ( X , w) and δ (Y, w) are going to accepting /final states or going to non-accepting /non-final states. Symbolically this can be represented as 1.       δ ( X , w)   ∈ F and δ (Y, w) ∈ F                        OR 2.       δ ( X , w)   ∉ F and δ (Y, w) ∉ F Minimization of DFA steps/rules of minimization of DFA in automata: Minimization of DFA questions or  problems  using partition method   can be solved by following steps(How to do minimization of DFA): Step1: Try to delete all the states to which we cannot reach from initial state (unreachable state) Step2: Draw state transition table Step3: Find out equivalen