Undecidable Problems: Reducibility (Part 2) | A Sample Reduction
lydia
Undecidable Problems: Reducibility (Part 2) | A Sample Reduction
4:21
Undecidable Problems: Reducibility (Part 1) | What are Reductions?
lydia
Undecidable Problems: Reducibility (Part 1) | What are Reductions?
4:42
Nonregular languages: How to use the Pumping Lemma
lydia
Nonregular languages: How to use the Pumping Lemma
4:56
What is the Pumping Lemma
lydia
What is the Pumping Lemma
5:11
Regular Operations
lydia
Regular Operations
5:25
The Halting Problem: The Unsolvable Problem
lydia
The Halting Problem: The Unsolvable Problem
4:14
Regular Languages: Nondeterministic Finite Automaton (NFA)
lydia
Regular Languages: Nondeterministic Finite Automaton (NFA)
6:37
Regular Languages: Deterministic Finite Automaton (DFA)
lydia
Regular Languages: Deterministic Finite Automaton (DFA)
6:28
Introduction to Languages, Strings, and Operations
lydia
Introduction to Languages, Strings, and Operations
5:44
Why study theory of computation?
lydia
Why study theory of computation?
3:26