Pumping Lemma

۱۴۰.۵ K


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

Published by: Computer Science Notes
Published at: ۳ years ago
Category: آموزشی