Sur la longueur des mots de rang donné d'un automate fini
Résumé
Let A be a finite automaton with n states. We prove that if there exists a word of rank ? (n-k) in A, then there exists such a word with length ? P(k), where P is a polynomial of degree 4.