00:01
We're asked to show that the set of all strings, which are 0 to the 2n, 1 to the n, for n equals 0, 1, 2, and so on, is not regular using the pumping lemma given in a previous exercise, exercise 22.
00:19
To do this, we'll use a proof by contradiction.
00:23
So suppose that the set is regular.
00:26
So we'll suppose that the set of all strings 0 to the 2n, 1 to the n, n equals 01.
00:36
And so on is regular.
00:45
Well, then it contains arbitrarily long strings.
00:54
So the pumping lemma tells us that for some strings u, u and v, where v is not the empty string and w, the strings u, v to the i, w are in the set for each i...