Introduction, Finite Automata, Regular Expressions
Michael Sipser · 1:00:34
Nondeterminism, Closure Properties, Conversion of Regular Expressions to FA
Michael Sipser · 1:03:27
Introduction to Cryptography
Christof Paar · 1:17:24
Proofs, Knowledge, and Computation: Zero-Knowledge Interactive Systems
Silvio Micali · 1:03:26
What Needs to Be Added to Machine Learning? PAC Learning and Reasoning
Leslie G. Valiant · 54:36
Differential Privacy: Fundamentals to Forefront
Cynthia Dwork · 59:33
Introduction, Finite Automata, Regular Expressions
This inaugural lecture for MIT's Theory of Computation course introduces finite automata, regular languages, and regular expressions. It formally defines these concepts and proves closure properties for regular languages under union and concatenation.
MIT 18.404J Theory of Computation, Fall 2020
Instructor: Michael Sipser
View the complete course: https://ocw.mit.edu/18-404JF20
YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP60_JNv2MmK3wkOt9syvfQWY