====== Teaching Materials (Automata: Theory, Trends, and Applications) ======

^Weeks  ^Topics ^
|Weeks 1 - 2|Alphabets, Strings, and Languages|
|Weeks 3 - 4|Models for Regular Languages|
| |Restricted Finite Automata|
| |Applications: Lexical Analysis|
| |Properties of Regular Languages|
|Weeks 5 - 8|Models for Context-free Languages|
| |Top-Down Parsing|
| |Bottom-Up Parsing|
| |Properties of Context-free Languages|
|Weeks 9 - 13|Turing Machines and General Grammars|
| |Church-Turing Thesis and Turing Machine|
| |Restricted Turing Machines| 
| |Universal Turing Machine| 
| |Theory of Computation| 
| |Recursion theorem and Kleene's s-m-n theorem|
| |Decidability and Decidable Problems for Finite Automata|
| |Decidable Problems for Context--Free Grammars| 
| |Undecidable Problems| 
| |General Approach to Undecidability and Computational Complexity|
^Download | {{:lectures:books:atta_lectures.zip|All Lectures}}|