An NP-hardness Result on the Monoid Frobenius Problem
classification
💻 cs.DM
cs.CC
keywords
problemco-finitedecideexpressionfollowingfrobeniusgivenmonoid
read the original abstract
The following problem is NP-hard: given a regular expression $E$, decide if $E^*$ is not co-finite.
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.