Which of the following statements is not correct ?

PYQ UGC NET 2017

Which of the following statements is not correct ?

  1. A.

    Every recursive language is recursively enumerable.

  2. B.

    L={0n1n0n∣n=1,2,3,…}L = \{0^n1^n0^n \mid n=1,2,3,\ldots\} is recursively enumerable.

  3. C.

    Recursive languages are closed under intersection.

  4. D.

    Recursive languages are not closed under intersection.

Attempted by 101 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…