8 marks · CO2 · Analyse
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.
State and prove the pumping theorem for regular languages, and prove that L = {wwᴿ | w ∈ {a,b}*} is not regular.