CS 5349 logo

AUTOMATA THEORY

SPRING 2013

PROFESSOR WILLIAM J. PERVIN


Students should use this site whenever possible in order to reduce everyone's paper load (and copying costs). Please visit this page frequently. It will be the most promptly updated source of information for the class. This page will also provide lecture notes, homework assignments for those who are traveling out of town, hints for the problems, etc.


This page is always under construction!


Announcements (Last update: 5/7/2013)

Homework (Last update: 2/01/2013)

Handouts (additional material, answers to examinations) (Last update: 2/25/2013)

Lectures (class notes) (Last updated: 5/7/2013)


CATALOG DESCRIPTION


CS 5349 Automata Theory (3 semester hours)

Deterministic and nondeterministic finite automata, regular expressions, regular sets; context-free grammars, pushdown automata, context-free languages. Selected topics from Turing Machines and undecidability.

Prerequisite: CS 5333


OFFICIAL SYLLABUS & TENTATIVE SCHEDULE

Syllabus


TEXT

"Theory of Computation", by Anil Maheshwari & Michiel Smid, Carleton University.
(Free Download:) Theory of Computation

 

ADDITIONAL MATERIAL

"Automata Theory" web-course by Jeffrey Ullman on coursera
(Free Download:) Ullman

JFLAP computer program and tutorial
(Free Download:) JFLAP


Please feel free to communicate with Prof. Pervin by email at any time.

Send email to Prof. Pervin

([email protected])

Office Hours: TR 6:00pm-6:45pm; and by appointment in ECSN4.626.


TA: Yanzhao Yang ( )
Office Hours: T 5:00-5:30pm; R 3:00-5:30pm
Office: S4.209
e-mail: [email protected]