UGC-NET | UGC NET CS 2018 Dec – II | Question 75

Which of the following problem is decidable for recursive language (L) ?
(A) Is L = ф ?
(B) Is w∈L, where w is a string ?
(C) Is L=R, where R is given regular set ?
(D) Is L = Σ* ?


Answer: (B)

Explanation:

Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.