HackerTube / Video
1. Introduction, Finite Automata, Regular Expressions
MIT OpenCourseWare
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.
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.
5 Hacker News mentions · 2021–2025