Skip to content
Related Articles

Related Articles

UGC-NET | UGC-NET CS 2017 Nov – III | Question 61
  • Last Updated : 21 Mar, 2018

Which of the following statements is not correct?
(A) Every recursive language is recursively enumerable.
(B) L = {0n1n 0n │n=1, 2 , 3, ….} is recursively enumerable.
(C) Recursive languages are closed under intersection.
(D) Recursive languages are not closed under intersection.


Answer: (D)

Explanation: Recursive languages are closed under intersection.
For detailed information Refer:Recursive and Recursive Enumerable Languages
So, option (D) is correct.

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :