%%%%%%%%%%%%
%
% Syllabus for PPL (20-ECES-730)
%
%%%%%%%%%%%%
\documentclass{article}
\usepackage{latexsym}
\oddsidemargin=-.25cm
\evensidemargin=-.25cm
\textwidth=16.8cm
\textheight=24cm
\headheight=0cm
\topmargin=-1cm
\headsep=1cm
%\parindent=0pt
\title{{\bf\huge Automata and Formal Languages}}
\author{Course Number: 20-ECES-670 \\
Instructor: Hongwei Xi \\
University of Cincinnati \\[1ex]
{\tt hwxi@ececs.uc.edu}}
%\author{}
\date{{\bf\Large Fall 2000}}
\begin{document}
\maketitle
\noindent
Here is some administrative information on the course.
\begin{center}
\begin{tabular}{ll}
Classroom & 501 Swift Hall \\
Time & MWF 2-2:50PM \\
Office Hours & Wednesday 3-6PM \\
Midterm & Monday, October 30, 2000, 2-2:50PM \\
Final & 7:30-9:30AM, Tuesday, Dec 5, 2000, 1:30-3:30PM \\
Grade & Homework(25\%) + Midterm(25\%) + Final(50\%) \\
\end{tabular}
\end{center}
{\em Automata and Formal Language} is an introductory course on
automata, formal languages, computability and computational
complexity.
Automata theory deals with the definitions and properties of
mathematical models of computation. These models play a role in
several areas of computer science. One model, called the finite
automaton is used in text processing, compilers and hardware
design. Another model, called the context-free grammar (which is
equivalent to pushdown automaton), is used in programming languages
and artificial intellegience. Yet another model, called Turing
machine, is used in formalizing the notion of computability. The
Church-Turing thesis states that the intuitive notion of algorithms is
equivalent to Turing machine algorithms, which makes it possible to
establish various undecidablity results. For instance, it is to be
presented in the course that the halting problem is undecidable.
The course also studies various time complexity results on algorithms,
introducing two important classes of problems P and NP.
Automata and Formal Language is an excellent place to begin the study
of the theory of computation, allowing practice with mathematical
formalism.
The following are some major topics that are to be covered in this
course.
\begin{enumerate}
\item Deterministic and nondeterministic finite automata
\item Regular languages
\item Context-free languages and pushdown automata.
\item Turing machines
\item Decidability
\item P and NP classes
\item Cook's theorem
\end{enumerate}
Please find more information on the homepage for the course at:
\begin{center}
\verb`http://www.ececs.uc.edu/~hwxi/academic/courses/eces-670/eces-670.html`
\end{center}
\end{document}