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.20217mFORMAL LANGUAGE & AUTOMATA THEORYShow that the language: L = \{ a^{n^2} b^n \mid n \ge 0 \} is not regular.20227mFormal Language & Automata TheoryProve that the language L = \{a^{i^2} \mid i \ge 1\} is not context-free language.20197mFormal Language & Automata TheoryThe language \{a^mb^nc^{m+n} \mid m, n \ge 1\} is (i) regular (ii) context-free but not regular (iii) context-sensitive but not context-free (iv) type-0 but not context-sensitive20212m
PreviousSuppose L is context free and R is regular, justify your answer with the help of example: (i) Is L-R necessarily context free? (ii) Is R-L necessarily context free?NextLet G be a context-free grammar in Chomsky normal form that contains b variable. Show that if G generates some string using a derivation with at least 2^b steps, then L(G) is infinite.