Sign Up
Prove that the language L = {ωω, ω ∈ ∑ *} i.e. compare of two infinite strings is not a regular language by pumping lemma.