1. Introduction, Finite Automata, Regular Expressions
MIT OpenCourseWare · 4 HN recommendations
Video Q&A
Ask AI to explain this scene or summarize the whole video. When an answer includes timestamps, select one to jump to that moment.
Try asking: What is the speaker explaining here?
Google sign-in is required. Review the maximum credit cost before confirming.
The first lecture of Michael Sipser's MIT 18.404J Theory of Computation course, covering course mechanics, finite automata, regular languages and regular expressions. It proves closure of regular languages under union and begins concatenation.
Why HN recommends it: HN recommends Sipser's free lectures as the companion to the standard theory of computation textbook and a path to understanding how computers fundamentally work.
“Sipser also has corresponding lectures that are available for free on YouTube here” Read on HN ↗