CSE 303 - Lecture Notes
- Finite automata (pdf, 16pp)
- Regular languages (pdf, 10pp)
- Context-free languages (pdf, 15pp)
- Pushdown automata (pdf, 13pp)
- Turing machines (pdf, 13pp)
- Unrestricted grammars (pdf, 10pp)
- Computability (pdf, 4pp)
- Countability, undecidability (pdf, 13pp)