Views:2|Rating:5.00|View Time:4:24Minutes|Likes:2|Dislikes:0
In this video question which was asked in the exam of GATE 2018 is discussed.

Question :- The set of all recursively enumerable language is

A. closed under complementation
B. closed under intersection
C. a subset of a set of all recursive languages
D. an uncountable set

Solution is given in the video.

Leave a Reply

Your email address will not be published. Required fields are marked *