Question: For a cnf-formula with m variables and c clauses, show that you can construct in polynomial time an NFA with O(cm) states that accepts

For a cnf-formula ‑ with m variables and c clauses, show that you can construct in polynomial time an NFA with O(cm) states that accepts all nonsatisfying assignments, represented as Boolean strings of length m. Conclude that P ≠ NP implies that NFAs cannot be minimized in polynomial time.

Step by Step Solution

3.47 Rating (147 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

It is possible to construct an N FA with O cm states th... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Introduction theory computation Questions!