Sign Up
Prove that the language
L = {ω | na (ω) = nb (ω)}, where ∑ = {a, b}, ω ∈ ∑ *} is not a regular language by pumping lemma.