Consider the statements: S₁: There exists no algorithm for deciding whether any two Turing machines M₁ and M₂ accept the same language. S₂: The problem of determining whether a Turing machine halts on any input is undecidable. Which of the following options is correct?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: A. Both S₁ and S₂ are correct
Explanation
TM equivalence and the halting problem are both undecidable.
More Theory of Computation and Compilers questions
- A bottom-up parser generates :
- The set A= { 0n1n2n | n= 1, 2, 3,..............} is an example of a grammar that is :
- Context-sensitive language can be recognized by a :
- Consider the two grammars: G₁: S → SbS | a G₂: S → aB | ab, A → AAB | a, B → ABb | b Which of the following options is correct?
- To obtain a string of n Terminals from a given Chomsky normal form grammar, the number of productions to be used is :
- Pushdown automata can recognize language generated by_________.