%
% Assignment 4a for CS3530 Computational Theory:
% Turing Machines
% Fall 2023
%
% Problems taken from Sipser
%

\documentclass{article}

\usepackage[margin=1in]{geometry}
\usepackage{amsfonts}
\usepackage{amsmath}
\usepackage[english]{babel}
\usepackage[utf8]{inputenc}
\usepackage{ae,aecompl}
\usepackage{enumerate}

% skip for paragraphs, don't indent
\parskip 6pt plus 1pt
\parindent=0pt
\raggedbottom

% a list environment with no bullets or numbers
\newenvironment{indentlist}{\begin{list}{}{\addtolength{\itemsep}{0.5\baselineskip}}}{\end{list}}

\begin{document}
\begin{center}
\textbf{\Large CS 3530: Assignment 4a} \\[2mm]
Fall 2023
\end{center}

\raggedright

\section*{Exercise 4.2 (10 points)}

\subsection*{Problem}

Consider the problem of determining whether a DFA and a regular expression are equivalent.
Express this problem as a language and show that it is decidable.

\subsection*{Solution}



\section*{Exercise 4.3 (10 points)}

\subsection*{Problem}

Let $ALL_\text{DFA} = \{ \langle A \rangle | A $ is a DFA and $ L(A) = \Sigma^* \}$.  Show that $ALL_\text{DFA}$ is decidable.

\subsection*{Solution}




\end{document}
