Great Ideas in Theoretical Computer Science: Finite Automata

Great Ideas in Theoretical Computer Science: Finite Automata

Ryan O'Donnell via YouTube Direct link

What is computation? What is an algorithm?

7 of 15

7 of 15

What is computation? What is an algorithm?

Class Central Classrooms beta

YouTube videos 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. 1 15-251: Great Theoretical ideas in Computer Science Lecture 4
  2. 2 Inspirational quotation #2
  3. 3 Example problem 2 PALINDROME
  4. 4 Example problem 3
  5. 5 String notation
  6. 6 Representing problems
  7. 7 What is computation? What is an algorithm?
  8. 8 Deterministic Finite Automata (DFAs)
  9. 9 Anatomy of a DFA
  10. 10 Computing with DFAs
  11. 11 Formal definition of DFAs
  12. 12 DFA-construction practice
  13. 13 Regular Languages
  14. 14 Proving a language L is not regular
  15. 15 Union Theorem

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.