Description
I will give non-regular exercises for you to try (remember, you must work on these besides following my lectures or read book sections!). These will not be graded. Solutions will be posted on D2L a bit later.
Problem 1
Let = fag. Use the pumping lemma to show that the following language is not regular:
A = fa2n jn 0g. Here a2n means a string of 2n a’s.
