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

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

\begin{document}
\maketitle

\paragraph{Exercise 1}
Show that the language $INFINITE_{DFA}$ is decidable where:
\[INFINITE_{DFA} = \{ \langle A \rangle \;|\; A \text{ is a DFA 
and $L(A)$ is an infinite language} \} \]

\newpage
\paragraph{Exercise 2}
Show that the language $ALL_{DFA}$ is decidable where:
\[ ALL_{DFA} = \{ \langle A \rangle \;|\; A \text{ is a DFA and }
L(A) = \Sigma^* \} \]

\end{document}
