Back to the 2019 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!} : 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 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