15 YouTube views, likes subscribers in 10 minutes. Free!
Get Free YouTube Subscribers, Views and Likes

Pumping Lemma

Follow
Computer Science Notes

Pumping Lemma For Regular Languages
This lecture shows an example of how to prove that a given language is Not Regular using Pumping Lemma.
a^n b^n is not regular language where n greater then and equal to 1

posted by difidented8