An NP-hardness Result on the Monoid Frobenius Problem

Details An NP-hardness Result on the Monoid Frobenius Problem An NP-hardness Result on the Monoid Frobenius Problem

2008-05-27

arxiv.org/abs/0805.4049v3

Computer Science

Discrete Mathematics

2 pages, working paper; an error in Problem 5 is corrected

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

An NP-hardness Result on the Monoid Frobenius Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An NP-hardness Result on the Monoid Frobenius Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An NP-hardness Result on the Monoid Frobenius Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-273086