%
% Assignment 2f for CS3530 Computational Theory:
% Context-free Languages
% Fall 2024
%
% 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 2f} \\[2mm]
Fall 2024
\end{center}

\raggedright

\section*{Problem 2.30ab (20 points)}

\subsection*{Problem}

Use the pumping lemma to show that the following languages are not context free.

\begin{itemize}
\item [a.] $\{ 0^n1^n0^n1^n | n \ge 0 \}$

  \textbf{Solution}

\item [b.] $\{ 0^n\#0^{2n}\#0^{3n} | n \ge 0 \}$

  \textbf{Solution}
  
\end{itemize}


\end{document}
