i. Assume T- ((M, w) | M is a Turing machine that accepts string w). Prove...

Transcribed Image Text:

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 (7 marks) is a regular language. 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 (7 marks) is a regular language.

Answer rating: 100% (QA)

Based on the image youve provided youve presented three questions regarding theoretical computer science Here is an explanation for each question i As... View the full answer