An NP-hardness Result on the Monoid Frobenius Problem
Abstract
The following problem is NP-hard: given a regular expression E, decide if E* is not co-finite.
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.