PyQdeck LogoPyQdeckSubjectsSyllabusBlog
Back to the 2022 paper

Module 2: Context-free languages and pushdown automata

20222m

The language {ambncm+n/m,n≥1}\{ 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 sensitive

Search GoogleAsk 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-sensitive20232mFormal 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 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-sensitive20212mFORMAL LANGUAGE & AUTOMATA THEORYWhich of the following languages is NOT regular? (i) {a^n b^n | n \ge 0} (ii) {a, b}* (iii) Finite languages (iv) Languages accepted by DFA20252m
NextWhich of the following pairs have DIFFERENT expressive powers? (i) Deterministic finite automata (DFA) and non-deterministic finite automata (NDFA) (ii) Deterministic push-down automata (DPDA) and non-deterministic push-down automata (NDPDA) (iii) Deterministic single-tape Turing machine and non-deterministic single-tape Turing machine (iv) Single-tape Turing machine and multi-tape Turing machine
Free AppAndroid App

Coursify Android App

Generate AI courses, take quick quizzes between classes, and master complex engineering concepts on the go.

Install Coursify