Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.17K Points
Coach

Q.) Which of the following problem is undecidable?

(A) Membership problem for CFL
(B) Membership problem for regular sets
(C) Membership problem for CSL
(D) Membership problem for type 0 languages
Correct answer : Option (D) - Membership problem for type 0 languages

Share

Discusssion

Login to discuss.