HackerTube

1. Introduction, Finite Automata, Regular Expressions

MIT OpenCourseWare20211:00:34625.9K views

Why it is in the catalog

Hacker News commenters linked this video 5 times between 2021 and 2025, from 4 different accounts. Its recommendation score is 3.

Open on YouTubeFind the HN threads

Tags

finite automataregular expressionsregular languagesmichael sipsermit ocw

More from Mathematics & Theoretical CS

Vectors | Chapter 1, Essence of linear algebra9:52

Vectors | Chapter 1, Essence of linear algebra

3Blue1Brown

2016Mathematics & Theoretical CS20 HN mentions
Ruby Conf 12 - Y Not- Adventures in Functional Programming by Jim Weirich53:22

Ruby Conf 12 - Y Not- Adventures in Functional Programming by Jim Weirich

Confreaks

2012Software Engineering & Languages20 HN mentions
But what is the Fourier Transform? A visual introduction.19:42

But what is the Fourier Transform? A visual introduction.

3Blue1Brown

2018Mathematics & Theoretical CS20 HN mentions
Quantum Computing for Computer Scientists1:28:23

Quantum Computing for Computer Scientists

Microsoft Research

2018Mathematics & Theoretical CS20 HN mentions
CppCon 2017: Matt Kulukundis “Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step”59:34

CppCon 2017: Matt Kulukundis “Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step”

CppCon

2017Mathematics & Theoretical CS19 HN mentions
The essence of calculus17:05

The essence of calculus

3Blue1Brown

2017Mathematics & Theoretical CS11 HN mentions
The Fast Fourier Transform (FFT): Most Ingenious Algorithm Ever?28:23

The Fast Fourier Transform (FFT): Most Ingenious Algorithm Ever?

Reducible

2020Mathematics & Theoretical CS9 HN mentions
"Propositions as Types" by Philip Wadler42:43

"Propositions as Types" by Philip Wadler

Strange Loop Conference

2015Mathematics & Theoretical CS20 HN mentions