- #1
mathmari
Gold Member
MHB
- 5,049
- 7
Hey! ![Eek! :eek: :eek:](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Show that the problem of determining whether a regular expression over the alphabet $\{0\}$ does not denote $0^*$ is NP-complete.
Could you give me some hints how I could do that?? (Wondering)
Show that the problem of determining whether a regular expression over the alphabet $\{0\}$ does not denote $0^*$ is NP-complete.
Could you give me some hints how I could do that?? (Wondering)