Question

10. A friend claims to have found a procedure that runs in linear time and reduces the REGULAR EXPRESSION string-matching problem, on a string of length and a pattern of length m, into a 2-SAT instance on O(n + m) variables and clauses.Argue why this procedure is unlikely to be correct.[8 marks]

Fig: 1