Quick Brown Fox in Formal Languages

Given a finite alphabet $\Sigma$ and a deterministic finite automaton on $\Sigma$, the problem of determining whether the language recognized by the automaton contains any pangram is NP-complete.