%0 Journal Article
%T Quick Brown Fox in Formal Languages
%A Kazuhiro Inaba
%J Computer Science
%D 2015
%I arXiv
%X 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.
%U http://arxiv.org/abs/1512.08168v1