Back to the 2021 paper
Similar questions
FORMAL LANGUAGE & AUTOMATA THEORYThe language \{ a^n b^n c^{n+m} \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-sensitive20232mFormal Language & Automata TheoryThe language \{ a^m b^n c^{m+n} / 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 sensitive20222mFormal 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-sensitive20212mFormal Language & Automata TheoryConsider the following language: L = \{a^m b^{2n} c^{3n} d^p \mid p > m \text{ and } m, n \ge 1\} Write a context-free grammar to generate L and write shortest string in L.20197m