Question: Let MINOR NFA = {M : M is an NFA with L(M) {0,1} * for which L(M) contains fewer than half the strings in {0,1}
Let MINORNFA = {M : M is an NFA with L(M) {0,1}* for which L(M) contains fewer than half the strings in {0,1}n for every n 0}. Show that MINORNFA is NP-hard.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
