Introduction to Automata
Theory, Languages, and Computation PPT PDF SLIDE
By John E. Hopcroft, Rajeew Motwani, and Jeffrey D. Ullman,
Text Book: Introduction to Automata Theory, Languages, and Computation.
By John E. Hopcroft, Rajeew Motwani, and Jeffrey D. Ullman,
Text Book: Introduction to Automata Theory, Languages, and Computation.
Download slides here :
| Subject | Slides | Readings | |
|---|---|---|---|
| Course Introduction | PPT, PDF | Chapter 1 | |
| Introduction to Automata | PPT, PDF | Section 2.1 | |
| Deterministic Finite Automata | PPT, PDF | Section 2.2 | |
| Nondeterministic Finite Automata | PPT, PDF | Sections 2.3 - 2.5 | |
| Regular Expressions | PPT, PDF | Chapter 3 | |
| Decision Properties of Regular Languages | PPT, PDF | Sections 4.1, 4.3, 4.4 | |
| Closure Properties of Regular Languages | PPT, PDF | Section 4.2 | |
| Context-Free Languages | PPT, PDF | Section 5.1 | |
| Parse Trees | PPT, PDF | Sections 5.2, 5.4 | |
| Normal Forms for Context-Free Grammars | PPT, PDF | Section 7.1 | |
| Pushdown Automata | PPT, PDF | Sections 6.1, 6.2 | |
| Equivalence of CFG's and PDA's | PPT, PDF | Section 6.3 | |
| The Pumping Lemma for Context-Free Languages | PPT, PDF | Section 7.2 | |
| Properties of Context-Free Languages | PPT, PDF | Sections 7.3, 7.4 | |
| Enumerations, Turing Machines | PPT, PDF | Sections 8.1, 8.2 | |
| More About Turing Machines | PPT, PDF | Sections 8.3 - 8.6 | |
| Undecidable Problems | PPT, PDF | Sections 9.1, 9.2 | |
| More Undecidable Problems | PPT, PDF | Sections 9.3 - 9.5 | |
| NP-Completeness | PPT, PDF | Section 10.1 | |
| Satisfiability, Cook's Theorem | PPT, PDF | Sections 10.2, 10.3 | |
| More NP-Complete Problems | PPT, PDF | Sections 10.4, 11.1 | |
| PSPACE-Complete Problems | PPT, PDF | Sections 11.2, 11.3 |
