MIT OpenCourseWare

1. Introduction, Finite Automata, Regular Expressions

About this video

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.

1. Introduction, Finite Automata, Regular Expressions

About this video

Keep your curiosity going.

Vectors | Chapter 1, Essence of linear algebra

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

But what is the Fourier Transform? A visual introduction.

But what is a neural network? | Deep learning chapter 1