Pumping Lemma

Описание к видео Pumping Lemma

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

Комментарии

Информация по комментариям в разработке