\documentclass[11pt]{article}
\usepackage{amsmath,amssymb,amsthm,tabu,enumerate,tikz}
\usetikzlibrary{automata,positioning}
\usepackage[margin=1in]{geometry}

\title{\vspace{-3ex}\bf Regular Language Pumping Lemma\\[2ex]
\rm\normalsize CS 311, Fall 2015}
\date{}
\author{}

\begin{document}
\maketitle
\paragraph{Exercise 1} Use the Pumping Lemma to show that the language $\{0^i1^j \;|\; i > j \}$
is not regular.

\newpage

\paragraph{Exercise 2} Use the Pumping Lemma to show that the language $\{w \;|\; w \text{ contains
an equal number of $a$'s and $b$'s}\}$ is not regular.

\end{document}
