GATE | GATE CS Mock 2018 | Question 62

A language L is called Turing-decidable (or just decidable), if there exists a Turing Machine M such that on input x, M accepts if x ∈ L, and M rejects otherwise. L is called undecidable if it is not decidable.
Which of following option is false?

(A) The class of decidable languages is closed under complement.
(B) The class of decidable languages is closed under union
(C) The class of decidable languages is closed under intersection
(D) None of these


Answer: (D)

Explanation: The class of decidable languages is closed under union, intersection, and complementation.
Option (D) is correct.

Quiz of this Question



My Personal Notes arrow_drop_up


Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.