Question:medium

Consider the language $L = \{a^n b^n \mid n \geq 0\}$. Choose the computational model that can recognize this language.

Show Hint

Pumping Lemma for Regular Languages is the formal tool used to prove that $a^n b^n$ cannot be recognized by a Finite Automaton.
Updated On: Jul 4, 2026
  • Finite Automata
  • Pushdown Automata
  • Turing Machine with no Stack
  • Linear Search Algorithm
Show Solution

The Correct Option is B

Solution and Explanation

Was this answer helpful?
0

Top Questions on Context Free Languages and Pushdown Automata

Questions Asked in AP PGECET exam