Quick Brown Fox in Formal Languages
Kazuhiro Inaba · arXiv (Cornell University) · 2015
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.