The GATE Grind

GATE 2009 CS – Question 40

Theory of Computation · Regular and Context-Free Languages, Pumping Lemma · 2 marks · Multiple choice

Let $L=L_1\cap L_2$, where $L_1=\{a^m b^m c a^n b^n\mid m,n\ge0\}$ and $L_2=\{a^i b^j c^k\mid i,j,k\ge0\}$. Then L is

  1. not recursive.
  2. regular.
  3. context-free but not regular.
  4. recursively enumerable but not context-free.

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (C) context-free but not regular.

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Regular and Context-Free Languages, Pumping Lemma questions

All Regular and Context-Free Languages, Pumping Lemma questions →