All Title Author
Keywords Abstract


An NP-hardness Result on the Monoid Frobenius Problem

Full-Text   Cite this paper   Add to My Lib

Abstract:

The following problem is NP-hard: given a regular expression $E$, decide if $E^*$ is not co-finite.

Full-Text

comments powered by Disqus