Quick Brown Fox in Formal Languages
Kazuhiro Inaba
TL;DR
This paper investigates the computational complexity of pangram-related problems in formal languages, proving that determining if a DFA's language contains a pangram is NP-complete and analyzing other related language classes.
Contribution
It introduces the NP-completeness of pangram detection in DFA languages and explores complexity results for various language classes and pangram problems.
Findings
Pangram detection in DFA languages is NP-complete.
Complexity results for pangram problems in different language classes.
Analysis of pangram-related problems in formal language theory.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Algorithms and Data Compression · Logic, programming, and type systems