Skip to content
Tape‑n‑Trace
PracticeSearch 26 tools

← All exercises

8 marks · CO2 · AnalyseQuestion Bank #26 · Module 2 · The pumping lemma

Prove the language is not regular

State and prove the pumping theorem for regular languages, and prove that L = {wwᴿ | w ∈ {a,b}*} is not regular.

Marked by handA pumping-lemma proof is a quantifier game; play it on the pumping-lemma page, then write the proof and check it against the hints.
Hints2 available