Question

The language {a^i b^j c^k|k=min(i,j)} is
A. regular but not finite
B. context-free but deterministic context free
C. context-sensitive but not deterministic context-free
D.recursive but not context-sensitive

Answer 1

Answer on Question#38644 – Math - Other

Let $n$ be the pumping-lemma constant, and consider $Z = a^{n}b^{n}c^{n}$. Using the pumping lemma

If a language $L$ is context-free, then there exists some integer $p \geq 1$ such that every string $s$ in $L$ with $|s| \geq p$ can be written as $s = uvxyz$.

We can see that this language is not a context-free language and also context-sensitive.

Answer: C.