LECTURE NOTES FOR CPT S 317
Introduction to Automata Theory & Formal Languages (PDF, PPT)
Regular Expressions (PDF, PPT)
Regular Language Properties (PDF, PPT)
Context Free Grammars and Languages (PDF, PPT)
Context-Free Language Properties (PDF, PPT)
- pumping lemma class exercises (PDF, PDF, PDF)
- Example for the substitution closure property proof (PDF)
Course & Finals Review ( PDF, PPT)
A special note to any instructor interested in using my slides:
When I was designing the lecture notes for this course back in Fall of 2008, I found it rather hard to find reusable (and editable) powerpoint slides on the internet (and understandably so due to perhaps the theoretical nature). So I took a daring step towards making my own powerpoint slides and rather surprisingly succeeded! Therefore, it is my intention that others who are in similar boots would one day benefit from these slides. If you are an instructor who is 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!
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.