Problem 1. Complete the TopHat worksheet titled Spring 2020 HW4.1. There are a total of 11 questions, each worth 2 points.
Problem 2. Using the application of the contrapositive of the Pumping Lemma (from lecture), prove that the following language L1 is not a regular language, where
L1 = {w | w ∈ {0,1}∗,the middle symbol of w is 1}.
Problem 3. Using the application of the contrapositive of the Pumping Lemma (from lecture), prove that the following language L2 is not a regular language, where
L2 = {x#y#z | x,y,z ∈ {0,1}∗,x + y = z (as binary numbers)}.
