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.