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
It is possible to construct an N FA with O cm states th... View full answer
Get step-by-step solutions from verified subject matter experts
