An NP-hardness Result on the Monoid Frobenius Problem
arXiv:0805.4049
Abstract
The following problem is NP-hard: given a regular expression , decide if is not co-finite.
2 pages, working paper; an error in Problem 5 is corrected
arXiv:0805.4049
The following problem is NP-hard: given a regular expression , decide if is not co-finite.
2 pages, working paper; an error in Problem 5 is corrected