Question
Download Solution PDFWhich of the following statements is not correct ?
Answer (Detailed Solution Below)
Detailed Solution
Download Solution PDFThe correct answer is "option 4".
EXPLANATION
option1: Correct
If there exists a Turing machine that accepts every string of the language and does not accept any string that is not in the language then, the language is recursively enumerable language.
So, every recursive language is also recursively enumerable.
option2: Correct
The language L = {0n 1n 0n | n = 1, 2, 3, ....} is recursive enumerable and it is accepted by Linear bounded Automataon.
option3: Correct
Recursive languages are closed under intersection.
option4: Not Correct
Since recursive languages are closed under intersection.
Hence, the correct answer is "option 4".
Last updated on Jul 7, 2025
-> The UGC NET Answer Key 2025 June was released on the official website ugcnet.nta.ac.in on 06th July 2025.
-> The UGC NET June 2025 exam will be conducted from 25th to 29th June 2025.
-> The UGC-NET exam takes place for 85 subjects, to determine the eligibility for 'Junior Research Fellowship’ and ‘Assistant Professor’ posts, as well as for PhD. admissions.
-> The exam is conducted bi-annually - in June and December cycles.
-> The exam comprises two papers - Paper I and Paper II. Paper I consists of 50 questions and Paper II consists of 100 questions.
-> The candidates who are preparing for the exam can check the UGC NET Previous Year Papers and UGC NET Test Series to boost their preparations.