Turing machine complexity R and RE, Automata
Budget: $10 – $30 USD
Looking for a freelancer for some questions in the subject.
Given Turing machine M.
Question is the following:
Given turing machine M, Define M^c as same as M apart from the accept and reject states. Prove the following langauses are R, RE, RE\R or not RE:
L1={<M>|∃w:w∈L(M)∩L(M^c}
L2={<M>|∃w:w∈L(M)and not in L(M^c}.
Given Turing machine M.
Question is the following:
Given turing machine M, Define M^c as same as M apart from the accept and reject states. Prove the following langauses are R, RE, RE\R or not RE:
L1={<M>|∃w:w∈L(M)∩L(M^c}
L2={<M>|∃w:w∈L(M)and not in L(M^c}.