Question

What is the language {a^m b^(m+n) | m,n >= 1} ? Explain.

(A) regular
(B) context-free but not regular
(C) context sensitive but not context free
(D) type-0 but not context sensitive

Answer 1

Answer on Question#38165 – Math - Other

Language $\{a^m b^{m+n}|m,n\leq 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^{\prime}s$ and $b^{\prime}s$.

Answer: (B).