Quick Brown Fox in Formal Languages
arXiv:1512.08168
Abstract
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.