Back to the 2025 paper
Similar questions
FORMAL LANGUAGE & AUTOMATA THEORYWhich of the following does not have left recursion? (i) Chomsky Normal Form (ii) Greibach Normal Form (iii) Backus–Naur Form (iv) All of the above20212mFormal Language & Automata TheoryThe logic of pumping lemma is a good example of (i) pigeon-hole principle (ii) divide-and-conquer technique (iii) recursion (iv) iteration20222mFormal Language & Automata TheoryWhich of the following does not have left recursions? (i) Chomsky normal form (ii) Greibach normal form (iii) Backus-Naur form (iv) All of the above20212mFormal Language & Automata TheoryPumping Lemma for CFLs is used to prove a language is (i) Not Context-Free (ii) Regular (iii) Decidable (iv) Turing recognizable20252m
PreviousThe Halting Problem is (i) Decidable (ii) Undecidable (iii) Context-Free (iv) RegularNextDefine the terms: Alphabet, Language, Grammar, and Derivation. Explain the relationship between them with suitable examples.
Student FinanceWeb Platform
Pocketly — Personal Finance for Students
Keep your hostel and college expenses under control. Track accounts, log spending in seconds, and stay within your monthly budget.