Skip to content
Tape‑n‑Trace
1
Automata
2
Equivalence
3
Properties
4
Grammars
5
Machines
Practice
⌘K
Search 26 tools
Auto
← All exercises
8 marks · CO2 · Analyse
Question Bank #27 · Module 2 · The pumping lemma
Prove the language is not regular
Prove that L = {aⁿbⁿ | n ≥ 0} is not regular.
Marked by hand
A pumping-lemma proof is a quantifier game; play it on the pumping-lemma page, then write the proof and check it against the hints.
Hints
3 available
Show a hint (3 left)