Consider the following Finite State Automaton:
The minimum state automaton equivalent to the above FSA has the following number of states:
Answer will be 2 state.
Minimum Finite Automata = DFA - (Unreachable States + Equal States) = DFA - ( q3 + q2)
Minimum Finite Automata = DFA - (Unreachable States + Equal States)
= DFA - ( q3 + q2)
Here q2 is equal state with q1 and q3 is unreachable state
So total 2 states left.
Hence Option B is Ans.