GATE 2018 CS Q7: Recursively Enumerable Languages

GATE 2018 CS Question Paper Complete Solution

Q 07. The set of all recursively enumerable languages is
(a) closed under complementation.
(b) closed under intersection.
(c) a subset of the set of all recursive languages.
(d) an uncountable set.

GATE 2018 QP link: https://drive.google.com/open?id=1pqoma6hhgHhOFl7vrLSTuFXDXl2iC9Kl

Final GATE 2018 Answer Keys: https://drive.google.com/open?id=1whFDTWVWev3NZLRwNVPHTXQG-n_9b3D6


Gate Helpline helps you in gate notifications, PSU, previous year papers, gate admit card, gate cutoff marks, gate results, scorecard, gate helpline number etc Gate Helpline provides a unique feature of Question Answer Discussion.

Gate Virtual Calculator Download link: https://play.google.com/store/apps/details?id=com.gatehelpline.apoorva.myapplication.myapplication

Gate Helpline Youtube Channel: http://www.youtube.com/c/Gatehelpline

WhatsApp Group: https://chat.whatsapp.com/invite/9UOt4id7L5X6WAYU9WvgWH

Gate Helpline: http://gatehelpline.com/

Gate Helpline Fb: https://www.facebook.com/gatehelplinedotcom

Gate Helpline Twitter: https://twitter.com/gatehelpline

Gate Helpline Google+: https://plus.google.com/+Gatehelpline

Gate Helpline Study Group: https://www.facebook.com/groups/GateHelplineStudyGroup/