Pumping Lemma
240.2 هزار بار بازدید -
7 سال پیش
-
Pumping Lemma For Regular LanguagesThis
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
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
7 سال پیش
در تاریخ 1396/03/30 منتشر شده
است.
240,267
بـار بازدید شده