0000 Example: L= Balance parenthesis | MyCareerwise

CREATE OWN LIBRARY

Example:

 

L = Balance parenthesis 

 

Prove that the language containing the set of all balance parentheses is not regular language by pumping lemma.