jwasinger/gist:d06ec01c967422981b842c4f4c00c3e9

## gistfile1.txt
\begin{enumerate}
\item Write a regular expression for all strings of letters that come from the alphabet $\sigma=\{a,b\}$ that start with either \textbf{aa} or \textbf{bb}, followed by a string of 0 or more b's, and ends with a single a [10 points]
\item Using Thompson's Construction, create a NFA that accepts the strings from the regular expression above. [10 points]
\item Using the Subset Construction, create a DFA from the NFA above. [10 points]
\item Try to merge states to get the smallest machine possible.  When you merge states, provide a justification for why the states may be merged. [10 points]
	\begin{enumerate}
	\item Write a regular expression for all strings of letters that come from the alphabet $\sigma=\{a,b\}$ that start with either \textbf{aa} or \textbf{bb}, followed by a string of 0 or more b's, and ends with a single a [10 points]
	\item Using Thompson's Construction, create a NFA that accepts the strings from the regular expression above. [10 points]
	\item Using the Subset Construction, create a DFA from the NFA above. [10 points]
	\item Try to merge states to get the smallest machine possible. When you merge states, provide a justification for why the states may be merged. [10 points]