GATE | GATE CS 1997 | Question 46
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
Recommended Posts:
- GATE | GATE CS 1997 | Question 53
- GATE | GATE CS 1997 | Question 54
- GATE | GATE CS 1997 | Question 56
- GATE | GATE CS 1997 | Question 57
- GATE | GATE CS 1997 | Question 63
- GATE | GATE CS 1997 | Question 52
- GATE | GATE CS 1997 | Question 41
- GATE | GATE CS 1997 | Question 46
- GATE | GATE CS 1997 | Question 47
- GATE | GATE CS 1997 | Question 48
- GATE | GATE CS 1997 | Question 49
- GATE | GATE CS 1997 | Question 36
- GATE | GATE CS 1997 | Question 72
- GATE | GATE CS 1997 | Question 50
- GATE | GATE CS 1997 | Question 51