CameraIcon
CameraIcon
SearchIcon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

The set of all recursively enumerable language is

A
closed under intersection
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
B
an uncountable set
No worries! We‘ve got your back. Try BYJU‘S free classes today!
C
a subset of the set of all recursive languages
No worries! We‘ve got your back. Try BYJU‘S free classes today!
D
closed under complementation
No worries! We‘ve got your back. Try BYJU‘S free classes today!
Open in App
Solution

The correct option is A closed under intersection
The set of RE languages is closed under intersection,not closed under complementation is not a subset of set of REC language and is a countable set.

flag
Suggest Corrections
thumbs-up
0
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Watch in App
Join BYJU'S Learning Program
CrossIcon