Lecture Notes

1. Introduction in Theory of Computing
   
2. Mathematical Review
3. Basic Concepts and Notations
4. Finite Automata (DFAs/NFas, e-NFAs)
   • Sample Proof  
   • Examples
     1. Example Language of Numbers 
     2. Other Automata Examples 
     3. Proof Example  
5. Regular Expressions
6. Properties of Regular Languages
7. Grammars
8. Properties of Context Free Languages
9. Decidability and Computability

---

10. Additional Reading Material: Grammars