Question: I need a justification that any DFA accepting regular language, A must have minimum 3 states. Give a regular language A such that any DFA

I need a justification that any DFA accepting regular language, A must have minimum 3 states.
Give a regular language A such that any DFA accepting A must have at least 3 states. Justify your
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
