Given a finite alphabet Σ and a deterministic finite automaton on Σ, 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.
@article{arxiv.1512.08168,
title = {Quick Brown Fox in Formal Languages},
author = {Kazuhiro Inaba},
journal= {arXiv preprint arXiv:1512.08168},
year = {2016}
}