lydia - ViDoe

I make videos about computer science sometimes!

Undecidable Problems: Reducibility (Part 2) | A Sample Reduction

4:21

Undecidable Problems: Reducibility (Part 2) | A Sample Reduction

Undecidable Problems: Reducibility (Part 1) | What are Reductions?

4:42

Undecidable Problems: Reducibility (Part 1) | What are Reductions?

Nonregular languages: How to use the Pumping Lemma

4:56

Nonregular languages: How to use the Pumping Lemma

What is the Pumping Lemma

5:11

What is the Pumping Lemma

Regular Operations

5:25

Regular Operations

The Halting Problem: The Unsolvable Problem

4:14

The Halting Problem: The Unsolvable Problem

Regular Languages: Nondeterministic Finite Automaton (NFA)

6:37

Regular Languages: Nondeterministic Finite Automaton (NFA)

Regular Languages: Deterministic Finite Automaton (DFA)

6:28

Regular Languages: Deterministic Finite Automaton (DFA)

Introduction to Languages, Strings, and Operations

5:44

Introduction to Languages, Strings, and Operations

Why study theory of computation?

3:26

Why study theory of computation?