This has to be done in Introduction to the Theory of Computation.

1. Use the pumping lemma to prove that the following language is not a regular language. {w | the length of w is odd, and its middle symbol is a 0} = {0, 1}