CSC444/344: Automata Theory and Formal Grammars (Fall 2005)
James Riely

Important Links

Syllabus

Course online

Old Lecture Notes, Extras

JFLAP

More Links
Software, Books and Other Resources
Lecture Materials
Notes HW
1. Sets, Languages, Logic [09/08]
Read Sipser pp1-34, p44-45 (up to example 1.11)
available available available
2. Finite Automata [09/15]
Read Sipser pp35-62
available available available
3. Regular Expressions and Languages [09/22]
Read Sipser pp63-76, A Proof of Kleene's Theorem by Rance Cleaveland
available available available
4. Minimal Deterministic Automata [09/29]
Read A Partition-Based Minimization Technique for Finite Automata by Rance Cleaveland
available available available
5. Midterm Exam [10/06]
not available not available not available
6. Context Free Languages [10/13]
Read Sipser pp77-100
available available available
7. Non-Context Free Languages [10/20]
Read Sipser pp99-100, pp115-119
available available available
8. Pushdown Automata [10/27]
Read Sipser pp101-114
available available available
9. Buchi Automata [10/03]
Read An Automata-Theoretic Approach to Linear Temporal Logic by Moshe Vardi
not available not available not available
10. Reactive Automata: Mealy, Moore, Statecharts, and Process Algebras [11/10]
not available not available not available
11. Final exam [11/17]
not available not available not available
Contact Hours
Class Hours: Wed 5:45pm-9:00pm in CDM 222 [Section 701]
Online, Anytime [Section 702]
Office Hours: Wed 4:00-5:00pm in CDM 846
Thu 4:00-5:00pm in CDM 846

The stylesheets used to create this website are based on Corin Pitcher's XSLT stylesheets for lecture slides.