Quick Brown Fox in Formal Languages
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 -complete. Various other language classes and problems around pangrams are analyzed.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.