STAT 2507 Study Guide - Final Guide: If And Only If, Np-Completeness
23 Oct 2020
School
Department
Course
Professor
Document Summary
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 that m enters after reading s, starting at state q. (note that f is irrelevant here. ) Correct dfa which satisfy constraints and in polynomial time can be guessed by non deterministic turing machine iff such dfa available or exist. For showing that problem is np complete reduce it to polynomial time. Consider the formula where and construction some constraints and are states. Creating pair in for enforcing as starting state. Every variable belongs to will create the pairs and.
