Completed
15-251: Great Theoretical ideas in Computer Science Lecture 4
Class Central Classrooms beta
YouTube playlists curated by Class Central.
Classroom Contents
Great Ideas in Theoretical Computer Science: Finite Automata
Automatically move to the next video in the Classroom when playback concludes
- 1 15-251: Great Theoretical ideas in Computer Science Lecture 4
- 2 Inspirational quotation #2
- 3 Example problem 2 PALINDROME
- 4 Example problem 3
- 5 String notation
- 6 Representing problems
- 7 What is computation? What is an algorithm?
- 8 Deterministic Finite Automata (DFAs)
- 9 Anatomy of a DFA
- 10 Computing with DFAs
- 11 Formal definition of DFAs
- 12 DFA-construction practice
- 13 Regular Languages
- 14 Proving a language L is not regular
- 15 Union Theorem
