\documentclass{article}

\usepackage{hevea}

\oddsidemargin 0cm
\textwidth 17cm

\begin{document}


\title{CS 3100 -- Models of Computation -- Fall 2010}
\date{August 24, 2010}

\maketitle

\begin{center}
{\bf Notes 1, Handed out: August 24, 2010}
\end{center}

\begin{itemize}
\item General introduction
\item ----
\item Tape, tape head, memory, transitions
\item ----
\item JFLAP illustration
\item ----
\item Strings accepted, language recognized
\item Examples from book
\item ----
\item Alphabet, language, language of an FA, unary language
\item ----
\item Length of a string, empty string, ``epsilon'' ($\varepsilon$)
\item ----
\item Representation in terms of $Q$, $\Sigma$, $q_0$, $T$ (accepting states), $\delta$
\item Example 1.6
\item ----
\item When do FA exist:
  \begin{itemize}
  \item Balanced parantheses
  \item Parity
  \item mod
  \item Is legal ASCII
  \item Is legal 10-digit phone number
  \item num 0's $>$ num 1's
  \item of the form $n$ zeros, then $n$ ones, then $n$ twos
  \item Is legal 10-digit phone number with a one-bit parity error somewhere
  \item Scan LSB-first and value is divisible evenly by 3
  \end{itemize}
\end{itemize}

\end{document}

%--

