Completed
15-251: Great Theoretical Ideas in Computer Science Spring 2016, Lecture 2
Class Central Classrooms beta
YouTube playlists curated by Class Central.
Classroom Contents
Deterministic Finite Automata
Automatically move to the next video in the Classroom when playback concludes
- 1 15-251: Great Theoretical Ideas in Computer Science Spring 2016, Lecture 2
- 2 Inspirational quotation #2
- 3 Example problem 1
- 4 Example problem 2: PALINDROME
- 5 Example problem 3
- 6 Representing instances/solutions
- 7 Representing problems
- 8 What is computation? What is an algorithm?
- 9 Anatomy of a DFA
- 10 Computing with DFAS
- 11 DFAs as code in a weird programming language
- 12 DFA construction practice
- 13 Formal definition of DFAS
- 14 Regular Languages
