Question: i. Assume T={(M,w)M is a Turing machine that accepts string w}. Prove that T is undecidable. (16 marks) ii. Prove that if we add a
i. Assume T={(M,w)M is a Turing machine that accepts string w}. Prove that T is undecidable. (16 marks) ii. Prove that if we add a finite set of strings to a regular language, the result is a regular language. (7 marks) iii. Prove that if we remove a finite set of strings from a regular language, the result is a regular language. (7 marks)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
