1.

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»


Discussion

No Comment Found

Related InterviewSolutions