lydia
I make videos about computer science sometimes!
Undecidable Problems: Reducibility (Part 2) | A Sample Reduction
Undecidable Problems: Reducibility (Part 1) | What are Reductions?
Nonregular languages: How to use the Pumping Lemma
What is the Pumping Lemma
Regular Operations
The Halting Problem: The Unsolvable Problem
Regular Languages: Nondeterministic Finite Automaton (NFA)
Regular Languages: Deterministic Finite Automaton (DFA)
Introduction to Languages, Strings, and Operations
Why study theory of computation?