\documentclass[11pt]{article}
\usepackage{amsmath,amssymb,amsthm,tabu,enumerate,tikz}
\usetikzlibrary{automata,positioning}
\usepackage[margin=1in]{geometry}

\title{\vspace{-3ex}\bf Turing Machines\\[2ex]
\rm\normalsize CS 311, Fall 2015}
\date{}
\author{}

\begin{document}
\maketitle

\paragraph{Exercise 1}
Give an informal description of a Turing Machine that decides the language:
\[ A = \{a^nb^nc^n \;|\; n \geq 0 \} \]

\newpage
\paragraph{Exercise 2}
Explain how a PDA with two stacks is equivalent to a Turing Machine.


\end{document}
