Deterministic finite automaton


#1

Show that a deterministic finite automaton with n states accepting a non empty set accepts a string of length m,m<n