\documentclass{article}
\input{6045preamble}


\begin{document}
\handout{4}{Prof. Ron Rivest}{21 Wednesday 2002}{Jonathan
  Herzog}{Handout 4: Recitation Problems}


\begin{problem}
\textbf{Warm up:} List all strings of length 3 or less that match the
regular expression
$$0^* \left(1 0 0^*\right)^*$$
\end{problem}

\begin{problem}
  Create, by hand, a machine (NFA or DFA) that recognizes the language
  described by the above regular expression.
\end{problem}

\begin{problem}
  Create, using the construction given in class, an NFA that
  recognizes the language described by the above regular expression.
\end{problem}

\begin{problem}
  Find a regular expression that describes the language recognized by
  the machine:
  \begin{center}
    \input{ho4-4.latex}
  \end{center}
\end{problem}

\end{document}

%%% Local Variables: 
%%% mode: latex
%%% TeX-master: t
%%% End: 
