CSED341 Automata and Formal Languages, Fall 2011

September 11
- The website is now open.
- Handouts will be updated, so do not download them unless marked with .

Dates and Titles	Topics	Lecture Slides
Lecture 1 Introduction to automata	Overall course introduction Introduction to automata	handout #0 (welcome) handout #1 (introduction)
Lecture 2 Finite automata	Deterministis finite automata (DFA) Nondeterministic finite automata (NFA) Equivalence between DFA and NFA	handout #2 (finite automata)
Lecture 3 Regular languages	Regular expressions Regular grammars Properties of regular languages	handout #3 (regular expressions) handout #4 (regular grammars) handout #5 (regular languages)
Lecture 4 Context-free languages	Context-free grammars Normal forms Push-down automata Properties of context-free languages	handout #6 (context-free grammars) handout #7 (normal forms) handout #8 (PDA) handout #9 (CFL)
Lecture 5 Turing machines	Standard Turing machine Variations of Turing machine Universal Turing machine Linear bounded automata Recursively enumerable languages	handout #10 (TM)