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.
Announcements (Last update: 7/7/2013)
Homework (See the Lecture notes in PowerPoint)
Handouts (additional material, answers to examinations) (Last update: 7/7/2013)
Lectures (class notes as PowerPoint Slides) (Last updated: 12/04/2013)
CS 4384 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
Computation", by Anil Maheshwari & Michiel Smid, Carleton University.
(Free Download:) Theory of Computation
Please feel free to communicate with Prof. Pervin by email at any time.Send email to Prof. Pervin
Office Hours: MW 1:30pm-2:30pm; and by appointment in ECSN4.626.
TAs: Benjamin Ferrell and Mustafa Faisal
Office Hours: Ferrell (W1-3; R2:30-3:30), Faisal (W3-5)
Office: ECSS 4.205
e-mails: firstname.lastname@example.org; email@example.com