Prove: If finite automata M with k states accepts a string with at least k characters, then the language L(M) is infinite
Hint. Consider a word a length $\geqslant k$ accepted by $M$ and a successful path for this word. Now prove that this path goes at least twice through the same state, thus producing a loop.