LECTURE NOTES FOR CPT S 317

Note: Slides get constantly updated during the course of the semester. So always download the latest version before use.

Course overview (PDF, PPT)

Introduction to Automata Theory & Formal Languages (PDF, PPT)

Finite Automata (PDF, PPT)

Regular Expressions (PDF, PPT)

    DFA to Reg. Exp additional notes (PDF)

Regular Language Properties (PDF, PPT)

    Pumping lemma in-class exercises (PDF)

Midterm I review (PPT, PDF)

Context Free Grammars and Languages (PDF, PPT)

    CFGs in-class exercises (PDF)

Pushdown Automata (PDF, PPT)

Context-Free Language Properties (PDF, PPT)

    - Simplifying CFGs - examples (PDF)

    - pumping lemma class exercises (PDF, PDF, PDF)

    - Example for the substitution closure property proof (PDF)

Midterm II review (PPT, PDF)

Turing Machines (PDF, PPT)

Undecidability (PDF, PPT)

Course & Finals Review ( PDF, PPT)

A note to instructors interested in using the above slides:

The above slides are designed to reflect the contents in the course book ""Introduction to automata theory, languages and computation"  by JE Hopcroft, R Motwani and JD Ullman.

If you are an instructor interested in using these slides in their original form or as a modified version, please feel free to do so. A single line in your lecture slides homepage or in the title slide indicating this webpage as the original source is sufficient for credit.  Note that these slides undergo continuous revision. Although I have made the best effort to carefully edit, there could be errors or typos that may have slipped my notice. I welcome any specific comments or corrections, particularly if they are fatal!