GATE | GATE CS 1997 | Question 46
Which one of the following is not decidable?
Given a Turing machine M, a string s and an integer k, M accepts s within k steps
Equivalence of two given Turing machines
Language accepted by a given finite state machine is not empty
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
Share your thoughts in the comments
Please Login to comment...