GATE : Computer Science and IT

The set of all recursively enumerable languages is , The set of all recursively enumerable languages is

The set of all recursively enumerable languages is




Solution
B. closed under intersection



Explanation
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.
CCC Online Test 2021 CCC Practice Test Hindi Python Programming Tutorials Best Computer Training Institute in Prayagraj (Allahabad) O Level NIELIT Study material and Quiz Bank SSC Railway TET UPTET Question Bank career counselling in allahabad Sarkari Exam Quiz Website development Company in Allahabad