(6 pts-2 pts each) Let L be a language such that L Sm Any and Ay Sm L. Justify your answers to the following questi...
(6 pts- 2 pts each) Let L be a language such that L Sm A your answers to the following questions: and AM Sm L. Justify a) Is L decidable? b) Is L Turing-recognizable? c) Is L Turing-recognizable? (6 pts- 2 pts each) Let L be a language such that L Sm A your answers to the following questions: and AM Sm L. Justify a) Is L decidable? b) Is L Turing-recognizable? c) Is L Turing-recognizable?
Please also note that there might be multiple answers for each question. Q1: Which of the following claims are true?* 1 point The recognizable languages are closed under union and intersection The decidable languages are closed under union and intersection The class of undecidable languages contains the class of recognizable languages For every language A, at least one of A or A*c is recognizable Other: This is a required question Q2: Which of the following languages are recognizable? (Select all...
1. Let n be a positive integer. Classify the languages (i) R = {(M)IM is a TM and L(M) contains exactly n strings) (ii) S- (M)|M is a TM and L(M) contains more than n strings as (a) decidable, (b) Turing-recognizable but not co-Turing-recognizable, (c) co-Turing-recognizable but not Turing-recognizable, (d) neither Turing-recognizable nor co-Turing-recognizable. Justify your answers.
Classify the language { (G) | G is a CFG, L(G) contains a palindrome}\ as (a) decidable (b) Turing-recognizable but not co-Turing recognizable (c) co-Turing recognizable but not Turing-recognizable (d) neither Turing nor co-Turing recognizable Justify your answer
Only 5-9 please 1. (10 points) True/False. Briefly justify your answer for each statement. 1) Any subset of a decidable set is decidable 2) Any subset of a regular language is decidable 3) Any regular language is decidable 4) Any decidable set is context-free 5) There is a recognizable but not decidable language 6) Recognizable sets are closed under complement. 7) Decidable sets are closed under complement. 8) Recognizable sets are closed under union 9) Decidable sets are closed under...
I need 7 - 10. Ignore others please! 1. (10 points) True/False. Briefly justify your answer for each statement. 1) Any subset of a decidable set is decidable 2) Any subset of a regular language is decidable 3) Any regular language is decidable 4) Any decidable set is context-free 5) There is a recognizable but not decidable language 6) Recognizable sets are closed under complement. 7) Decidable sets are closed under complement. 8) Recognizable sets are closed under union 9)...
Let Azfa"b"c" I n 0 }. Answer each of the following question: 1. 2. 3. 4. Is A a regular language? Is A a context free language? Is A Turing recognizable? Is A Turing decidable?
2. (10 points) Determine whether the following languages are decidable, recognizable, or undecidable. Briefly justify your answer for each statement. 1) L! = {< D,w >. D is a DFA and w E L(D)} 2) L2- N, w> N is a NF A and w L(N) 3) L,-{< P, w >: P is a PDA and w ㅌ L(P); 4) L,-{< M, w >: M is a TM and w e L(M)} 5) L,-{< M, w >: M is a...
2. Let L = {hMi: M is a Turing machine that accepts at least two binary strings}. a) Define the notions of a recognisable language and an undecidable language. [5 marks] b) Is L Turing-recognisable? Justify your answer with an informal argument. [5 marks] c) Prove that L is undecidable. (Hint: use Rice’s theorem.) [20 marks] d) Bonus: Justify with a formal proof your answer to b). [20 marks] 2. Let L-M M): M is a Turing machine that accepts...
10 pts Question 5 Select all the statements below which are true: Any REC language is RE. Any REC or RE language is accepted by some Turing Machine. @ Every language is accepted by some TM @ The language L (a"bc :n1 is CF. The language L (aww :n 2 0, w E (a b)') is CF cs, REC, and RE. : T The grammar below is CS A- acbA I a