Question
Download Solution PDFThe set A = { 0n 1n 2n | n = 1, 2, 3, ......... } is an example of a grammar that is:
Answer (Detailed Solution Below)
Detailed Solution
Download Solution PDFLanguage A = {0n 1n 2n | n = 1, 2, 3, .........}
It is context sensitive language.
- This language cannot be a context free grammar. Since all 0, 1 and 2’s is equal in number.
Reason:
If we take the case of push down automata. Then first push all the 0’s into the stack then with each 1 pop all 0’s. But at the end, there is no symbol at the stack and input is remaining. So, it is not accepted by push down automata and cannot be context free grammar.
- It is accepted by linear bounded automata with the help of forward and backward movement of tape.
Machine that accepts Language A:
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.