Question

The language {a^i b^j c^k|i+j>=k} is
A. regular but not finite
B. context-free but not regular
C. context-sensitive but not context-free
D.type-0 or recursive but not context-sensitive

Answer 1

Answer on Question#38648 – Math - Other

$L$ is easily seen to be a context-free language, we can design a pushdown automaton (type of automaton that employs a stack) that guesses whether to compare the $a^{\prime}s$ or $b^{\prime}s$ with the $c^{\prime}s$.

Answer: B.