The unforgettable Pumping Lemma! (Discrete Mathematics: Formal Languages and Automata) скачать в хорошем качестве

The unforgettable Pumping Lemma! (Discrete Mathematics: Formal Languages and Automata)

I am a Professor in the Computer Science department at the University of Cambridge. Through this channel I welcome anyone in the world to attend my lectures. This is the first video in a series on Formal Languages and Automata that forms the last part of the Discrete Mathematics course for first year computer scientists. All regular languages enjoy the interesting property that the strings in them, provided they are long enough, can be pumped. To pump a string is to make longer and longer versions of it that are all still in the language. The Pumping Lemma tells us why this works and how it is done. Many thanks to those of you who are giving thumbs up to these videos and subscribing to the channel. Your support is greatly appreciated and it causes Youtube to offer this material to more viewers who might like it. Course web page: https://www.cl.cam.ac.uk/teaching/cur... Course handout: https://www.cl.cam.ac.uk/teaching/202... My home page: http://frank.stajano.com