Using the Pumping Lemma (Discrete Mathematics: Formal Languages and Automata)

Опубликовано: 29 Январь 2021
на канале: Frank Stajano Explains

808

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.

The Pumping Lemma tells us that all regular languages enjoy a certain property. The main use of this lemma is in reverse: we use it to prove that a language cannot be regular, by showing that it cannot satisfy that property. Such a proof is sometimes complicated. In this video we show a few examples.

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