Panalphebetic strings provable by DFA?

263 Views Asked by At

Is the language of panalphabetic strings decidable by DFA? If so, how can I prove it?

A string {a,…,z}* is said to be panalphabetic if it contains at least one occurrence of each letter.