Register

UGC NET CSE | December 2019 | Part 2 | Question: 51

• edited by
276 views
0 votes
0 votes

Consider the following statements:

$S_1$: These exists no algorithm for deciding if any two Turing machines $M_1$ and $M_2$ accept the same language

$S_2$: Let $M_1$ and $M_2$ be arbitrary Turing machines. The problem to determine $L(M_1) \subseteq L(M_2)$ is undecidable 

Which of the statements is (are) correct?

  1. Only $S_1$
  2. Only $S_2$
  3. Both $S_1$ and $S_2$
  4. Neither $S_1$ nor $S_2$
• edited by
User Avatar

1 Answer

0 votes
0 votes
Option C is the answer. Both S1 and S2 are correct.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
2 answers
1
soujanyareddy13 asked May 12, 2021
2,858 views
UGC NET CSE | December 2019 | Part 2 | Question: 1
A basic feasible solution of an $m \times n$ transportation problem is said to be non-degenerate, if basic feasible solution contains exactly _______ number of individual allocation in ______ positions. $m+n+1$, independent $m+n-1$, independent $m+n-1$, appropriate $m-n+1$, independent
A basic feasible solution of an $m \times n$ transportation problem is said to be non-degenerate, if basic feasible solution contains exactly _______ number of individual...
User Avatar
4 votes
4 votes
6 answers
3
soujanyareddy13 asked May 12, 2021
1,938 views
UGC NET CSE | December 2019 | Part 2 | Question: 3
The Boolean expression $AB+A \overline{B}+\overline{A}C+AC$ is unaffected by the value of the Boolean variable _________. $A$ $B$ $C$ $A, B$ and $C$
The Boolean expression $AB+A \overline{B}+\overline{A}C+AC$ is unaffected by the value of the Boolean variable _________.$A$$B$$C$$A, B$ and $C$
User Avatar
Link Copied!