UGC-NET DEC-2019 Part-2
November 27, 2023UGC-NET DEC-2019 Part-2
November 27, 2023UGC-NET DEC-2019 Part-2
| Question 14 |
Consider the following statements:
S1: These exists no algorithm for deciding if any two Turning machine M1 and M2 accept the same language.
S2: Let M1 and M2 be arbitrary Turing machines. The problem to determine L(M1)⊆ L(M2)is undecidable.
Which of the statements is (are) correct?
S1: These exists no algorithm for deciding if any two Turning machine M1 and M2 accept the same language.
S2: Let M1 and M2 be arbitrary Turing machines. The problem to determine L(M1)⊆ L(M2)is undecidable.
Which of the statements is (are) correct?
| Only S1 | |
| Only S2 | |
| Both S1 and S2 | |
| Neither S1 nor S1 |
Question 14 Explanation:
Statement S1 is correct because equality problem of recursively enumerable languages is undecidable.
Statement S2 is correct because subset problem of recursively enumerable languages is undecidable.
Statement S2 is correct because subset problem of recursively enumerable languages is undecidable.
Correct Answer: C
Question 14 Explanation:
Statement S1 is correct because equality problem of recursively enumerable languages is undecidable.
Statement S2 is correct because subset problem of recursively enumerable languages is undecidable.
Statement S2 is correct because subset problem of recursively enumerable languages is undecidable.