Multiple choice

The language {ambm+n | m,n $\le$ 1} is

  1. regular

  2. context-free but not regular

  3. context sensitive but not context free

  4. type-0 but not context sensitive

Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

Language {an bn cm+n/m,n $\ge$ 1} is a context free language since it can be represented by pushdown automata, but it is not regular since $\Delta$FA can't count the no. of a's & b's and then check the sum for occurrence of c.