Question
Download Solution PDFConsider the following language families:
L1 ≡ The context – free languages
L2 ≡ The context – sensitive languages
L3 ≡ The recursively enumerable languages
L4 ≡ The recursive languages
Which one of the following options is correct?
Answer (Detailed Solution Below)
Detailed Solution
Download Solution PDFContext free languages: A language is said to be context free if and only if there exists a context free grammar for it. A grammar G = (V, T, S, P) is said to be context free is all production is in the form of A -> x where A ϵ V and x ϵ (V U T)*. These are accepted by push down automata.
Context sensitive languages: If there exists a context sensitive grammar for a language, then it is known context sensitive language. Context sensitive grammar is one in which all productions are of the form x -> y where x, y ϵ (V U T)+ and x<=y. These are accepted by linear bounded automata.
Recursive languages: A language is recursive if there exists a Turing machine accepts it and halts on every input string.
Recursive enumerable languages: A language is recursive enumerable if there exists some Turing machine which accepts it.
Last updated on Jun 19, 2025
-> The UGC NET City Slip 2025 has been released on its official website today.
-> 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.