0000 Example: L={ωω, ωϵ∑*} | MyCareerwise

FOR FREE MATERIALS

Example:

 

 

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