Back to the 2019 paper
Similar questions
FORMAL LANGUAGE & AUTOMATA THEORYShow that the language of palindromes over \{a, b\} is not regular.20227mFORMAL LANGUAGE & AUTOMATA THEORYProve that L = \{ a^i b^i \mid i \ge 0 \} is not regular using the pumping lemma.20247mFormal Language & Automata TheoryWrite the context-free grammar to create palindrome over \{a, b\}.20207mFORMAL LANGUAGE & AUTOMATA THEORYUse the pumping lemma to prove that the language L = \{a^n b^n : n \ge 1\} is not regular.20257m
PreviousProve that the language L = \{a^{i^2} \mid i \ge 1\} is not context-free language.NextConsider 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.
Budget AppAndroid App
Pocketly on Android
Log daily food, travel, and hostel expenses instantly. Set monthly spending limits and see where your money goes without complex spreadsheets.