Which one of the following is not decidable?
(A) Given a Turing machine M, a string s and an integer k, M accepts s within k steps
(B) Equivalence of two given Turing machines
(C) Language accepted by a given finite state machine is not empty
(D) Language generated by a context free grammar is non-empty
Answer: (B)
Explanation:
Quiz of this Question
Please comment below if you find anything wrong in the above post
GATE | GATE CS 1997 | Question 46
Recommended Articles