Ex from Shallit. Let be a language. If is s.t. say that has finite index equal to . Then for every there exists a regular language of finite index equal to .
Proof. Fix and pick such that .
Let be the language of words containing at most one distinct letter in . This is a regular language. Then is the language of words containing at most distinct letters in . Since one has that for every but . Q.E.D.