Question

Urgent plz

Check EXACTLY THOSE daims that are TRUE. (Note on notation: for any program say X(where X may be an automaton of any type (as stated), or a grammar, or a regular expression), let L(X) stand for the language defined by X.) There exists an algorithm that operates as follows. INPUT: Turing machine M that decides set L(M) OUTPUT: Turing machine My that accepts the complement of L(M) by halting There exists an algorithm that operates as follows. INPUT: Turing machine M that accepts a set L(M) by halting QUESTION: Is L(M) context free? There exists an algorithm that operates as follows. INPUT: Turing machine M that accepts set L(M) by final state QUESTION: Is L(M)decidable ? There exists an algorithm that operates as follows. INPUT context free grammar G. OUTPUT: Turing machine M that accepts the complement of L(G) by final state There exists an algorithm that operates as follows. INPUT: Turing machine M and a regular expressione QUESTION: Is Lle) = L(M) ? There exists an algorithm that operates as follows. INPUT regular expressione OUTPUT: Turing machine M that accepts the complement of L(e) by halting There exists an algorithm that operates as follows. INPUT Turing machine My that accepts set L(M) by final state OUTPUT: Turing machine M that accepts set L(M) by halting There exists an algorithm that operates as follows. INPUT: Turing machine M that accepts set L(M) by final state OUTPUT Turing machine My that accepts the complement of L(M) by halting There exists an algorithm that operates as follows. INPUT: context free grammar Gand a Turing machine M QUESTION: Is LIG) - L(M)? There exists an algorithm that operates as follows. INPUT Turing machine My that accepts set L(M) by halting and Turing machine M2 that accepts the complement of L(M) by halting OUTPUT: Turing machine My that accepts the complement of L.(M) by halting

Answer 1

: 2) input: turing machine m that accepts a set of L(m)

output: is L(m) context free?

3) input : tuning machine accepts set L(m)

outputL is L(m) decideble?

5) input: tunong machine M and regular expression e

question: is L(e) = L(m)

9) input: context free grammer G and turing machine M

QuestionL is L(G) = L(M)