PyQdeck LogoPyQdeckSubjects
Back to the 2019 paper

Module 2: Context-free languages and pushdown automata

20197m

Consider the following language:
L={amb2nc3ndp∣p>m and m,n≥1}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 LL and write shortest string in LL.

Search GoogleAsk AI

Similar questions

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-sensitive20212mFORMAL 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-sensitive20212m
PreviousShow that L = \text{palindrome over } \{a, b\} is not regular.NextConvert the following context-free grammar into GNF: S \to XY X \to YS \mid b Y \to SX \mid a