Lecture 26
Section outline
-
December 1st, Friday (12:30-14:30)
Turing Machine
- Nondeterministic TM
- TM with restrictions
- TM with semi-infinite tape
- Multi-stack TM
- TM and modern computers
Exercises
- Minimization of DFA (exercise from final exam of February 13th, 2019)
References
- Hopcroft et al., chapter 8