Beginner
Theory of Computation
Q22 / 100
What is the language {aⁿbⁿ | n ≥ 0}?
Correct! Well done.
Incorrect.
The correct answer is B) A context-free language that is not regular
B
Correct Answer
A context-free language that is not regular
Explanation
{aⁿbⁿ} is the classic example of a CFL that is not regular. A DFA cannot count arbitrarily, but a PDA can use its stack to count matching a's and b's.
Progress
22/100