Quick Brown Fox in Formal Languages

Given a finite alphabet $\mathrm{\Sigma }$ and a deterministic finite automaton on $\mathrm{\Sigma }$, the problem of determining whether the language recognized by the automaton contains any pangram is \NP-complete. Various other language classes and problems around pangrams are analyzed.