STAT 2507 Study Guide - Final Guide: If And Only If, Non-Deterministic Turing Machine, Co-Np
23 Oct 2020
School
Department
Course
Professor
Document Summary
Call a regular expression star-free if it does not contain any star operations. | r and s are equivalent star-free regular expressions}. Here in the given definition of language any string belongs to this iff it is of the following given form: Both of them from are star free. One of them from is not star free or both are not star free. If do not represent any of two regular expression encoding or. Machine) in the polynomial time. is of the form where either one is not star free or both are not star free then the string is easily accepted in dtm (deterministic turing. If first condition follows that is are star free then there must be some string which is polynomial of size. Hence there will be a ntm (non deterministic turing machine) which find string in polynomial time, but it will not able to find string where.
