Quick Brown Fox in Formal Languages
classification
💻 cs.FL
keywords
automatonfinitelanguagesigmaalphabetanalyzedaroundbrown
read the original abstract
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. Various other language classes and problems around pangrams are analyzed.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.