Finite Automata and Regular Expressions | MIT 18.404J Lecture 1

MIT OpenCourseWare · Lecture · 1 h 1 min · 2021 · YouTube title: 1. Introduction, Finite Automata, Regular Expressions

Why it's here

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.

What it covers

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.