\documentclass[11pt]{article}
\usepackage{handout2e}
\begin{document}
\input{macros}
\input{courseMacros}
\thispagestyle{empty}
\setlength{\parindent}{0pt}
\setlength{\parskip}{1.8ex}

\head{CSG714}{Theory of Computation}{Spring 2009}{26 January 2009}{5}

\begin{center}
\Large{\bf Problem of the Week -- 3}
\end{center}

\noindent {\bf Decidability}

Problem 4.25 of text: Show that the language $\{\langle M \rangle: M
\mbox{ is a DFA that accepts some string with more 1s than 0s}\}$ is
decidable.

\end{document}