The previous lecture in this series is here. The next lecture in this series is here.
Quickly reviewed last lecture. Showed the decidability of various problems about automata and grammars. Also showed that acceptance problem for TMs is T-recognizable.
These videos are of a lecture course by Michael Sipser at the Massachusetts Institute of Technology in 2020, and made available as part of its OpenCourseWare initiative.