The language \{a^mb^nc^{m+n} \mid m, n \ge 1\} is (i) regular (ii) con — PYQDeck

PyQdeckBEU PYQ Archive Subjects

Back to the 2021 paper

Module 2: Context-free languages and pushdown automata

20212m

The 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-sensitive

Search Google Ask AI

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-sensitive20232m FORMAL LANGUAGE & AUTOMATA THEORYThe language: L = \{ a^m b^n c^{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 Formal 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 sensitive20222m Formal Language & Automata TheoryShow that the language L = \{a^{n!} : n \ge 0\} is not regular or not context-free language.20217m

PreviousEnumerator is a Turing machine with (i) an output printer (ii) 5 input tapes (iii) a stack (iv) None of the above NextThe maximum number of states of a DFA converted from an NFA with n states is (i) n (ii) n^2 (iii) 2^n (iv) None of the above