Back to the 2021 paper
Similar questions
Formal Language & Automata TheoryShow that the language L = \{a^{n!} : n \ge 0\} is not regular or not context-free language.20217mFORMAL LANGUAGE & AUTOMATA THEORYShow that the language: L = \{ a^{n^2} b^n \mid n \ge 0 \} is not regular.20227mFORMAL LANGUAGE & AUTOMATA THEORYUse the pumping lemma to prove that the language L = \{a^n b^n : n \ge 1\} is not regular.20257mFormal Language & Automata TheoryProve that the language L = \{a^{i^2} \mid i \ge 1\} is not context-free language.20197m
PreviousSuppose L is CFL and R is regular: (i) Is L - R always CFL? (ii) Is R - L always CFL?NextLet G be a CFG in CNF with b variables. Show that if G derives any string using at least 2^b steps, then L(G) is infinite.
Official AppAndroid App
PYQDeck for Android
Solve BEU previous-year exam papers anywhere, anytime. Fast search, offline paper viewing, and step-by-step solutions designed specifically for your phone.