0000 Example: L={ω|n_a (ω) = n_b (ω)}, where ∑={a, b}, ω ϵ∑*} | MyCareerwise

CREATE OWN LIBRARY

Example:

 

 

Prove that the language

L = {ω | na (ω) = nb (ω)}, where    = {a, b}, ω   *} is not a regular language by pumping lemma.