\documentclass[12pt]{amsart}

\newcommand{\lra}{\longrightarrow}
\newcommand{\Z}{{\mathbf Z}}
\newcommand{\Q}{{\mathbf Q}}
\newcommand{\R}{{\mathbf R}}
\newcommand{\C}{{\mathbf C}}
\newcommand{\Proj}{{\mathbf P}}
\newcommand{\northpole}{{\mathbf n}}
\renewcommand{\Re}[1]{{\text Re}(#1)}
\renewcommand{\Im}[1]{{\text Im}(#1)}

\include{xy}
\xyoption{all}
\SelectTips{cm}{}
\CompileMatrices

\include{iJSepsf}
\newcommand{\graphillus}[3]{\epsfysize=#1truein
\vbox{\centerline{\epsffile{#2.eps}}\caption{#3}}}

\theoremstyle{plain}
\newtheorem{thm}{Theorem}[section]
\newtheorem{defn}[thm]{Definition}
\newtheorem{prop}[thm]{Proposition}
\newtheorem{lem}[thm]{Lemma}
\newtheorem{cor}[thm]{Corollary}

\begin{document}

\title{Assignment from Chapter 4 of Sipser}
\maketitle

Exercise
\begin{itemize}
\item 4.2 (whether DFAs and regular expressions are equivalent is decidable)
\end{itemize}

Problems
\begin{itemize}
\item 4.10 (whether PDAs have infinite languages is decidable)
\item 4.19 (whether DFAs have palindromic languages is decidable)
\item 4.22 (whether PDAs have useless states is decidable)
\item 4.28 (no Turing-recognizable language can describe deciders for all
decidable languages)
\end{itemize}

\end{document}
