Dates and Titles 
Topics 
Lecture Slides 
Lecture 1
Introduction to automata 

Overall course introduction

Introduction to automata


Lecture 2
Finite automata 

Deterministis finite automata (DFA)

Nondeterministic finite automata (NFA)

Equivalence between DFA and NFA


Lecture 3
Regular languages 

Regular expressions

Regular grammars

Properties of regular languages


Lecture 4
Contextfree languages 

Contextfree grammars

Normal forms

Pushdown automata

Properties of contextfree languages


Lecture 5
Turing machines 

Standard Turing machine

Variations of Turing machine

Universal Turing machine

Linear bounded automata

Recursively enumerable languages

Undecidability

Kolmogorov complexity

