Lecture Notes

1. Introduction in Theory of Computing (Section 1) 2/page 4/page 6/page 
2. Mathematical Review 2/page 4/page 6/page 
3. Basic Concepts and Notations
4. Finite Automata (DFAs/NFas, e-NFAs)
5. Examples
6. Regular Expressions
7. Properties of Regular Languages
8. Grammars
9. Properties of Context Free Languages
10. Decidability and Computability
11. Additional Reading Material