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

\newcommand{\halfnfa}{\mbox{{\sc Half-Paths-NFA}}}

\head{CSG714}{Theory of Computation}{Spring 2008}{25 January 2008}{5}

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

\noindent{\bf Undecidability}

For a given language $L$, define $L^{\cal R}$ as the language $\{w^R:
w \in L\}$.  (Recall that $w^R$ is the reverse of $w$.)  Prove that it
is undecidable to determine whether $L = L^R$.

\end{document}

