Show that the following problem is NP-complete. You are given a set of states Q = {q
Question:
Show that the following problem is NP-complete. You are given a set of states Q = {q0, q1, . . . , ql} and a collection of pairs {(s1, r1), . . . , (sk, rk)} where the si are distinct strings over Σ = {0, 1}, and the ri are (not necessarily distinct) members of Q. Determine whether a DFA M = (Q, Σ, δ, q0, F) exists where (q0, si) = ri for each i. Here, (q, s) is the state thatM enters after reading s, starting at state q. Note that F is irrelevant here.
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Question Posted: