Describe a regular language that cannot be accepted by any DFA that has only three states.I'm not really sure where to start on this and was wondering if someone could give me some tips or advice. I understand that the pumping lemma can be used to prove a language is not regular, but in this case, it should be a regular language. If anyone has any thoughts it would be appreciated.
Regular language not accepted by DFA having at most three states
formal languages;regular languages;finite automata;pumping lemma