State True Or Falsebr Statement If An Nstate Dfa Accepts A #384

State true or false:<br /> Statement: If an n-state DFA accepts a string w of length n or more, then there must be a state that appears twice on the path labeled w from the start state to the final state.

This multiple choice question (MCQ) is related to the book/course gs gs101 Automata Theory. It can also be found in gs gs101 Properties of Regular Languages - Testing Emptiness and Membership - Quiz No.1.