20:14

Why There's (Likely) No Pumping Lemma for Context-Sensitive Languages

Easy Theory

Shared 16/07/2021

50:41

Pumping Lemma for Context-Free Languages -- Intro Theory of Computation Help Session #10

Easy Theory

Shared 11/09/2021

17:13

What is a DFA computation?

Easy Theory

Shared 30/06/2021

12:18

Formal Definition of Deterministic Finite Automata

Easy Theory

Shared 24/06/2021

18:26

"Simple" Computers

Easy Theory

Shared 23/06/2021

12:07

Acceptance for Turing Machines is Undecidable, but Recognizable

Easy Theory

Shared 18/01/2021

08:59

Emptiness for Turing Machines is Undecidable

Easy Theory

Shared 18/01/2021

10:48

Regular Expression Examples

Easy Theory

Shared 31/07/2020

14:05

WTF is a DFA Computation?

Easy Theory

Shared 26/05/2020

14:50

How do we formally define a DFA?

Easy Theory

Shared 22/05/2020

10:40

Introduction to the Theory of Computation (Full Course) - Easy Theory

Easy Theory

Shared 20/05/2020

15:26

Sparse Languages are Not Regular! [HARD Pumping Lemma!]

Easy Theory

Shared 07/05/2020

08:25

Don't Forget to Pump(ing Lemma) Twice!

Easy Theory

Shared 15/04/2020

11:15

Infinite DFAs (and showing it is decidable!)

Easy Theory

Shared 07/04/2020

06

Useless States in a DFA is Decidable!

Easy Theory

Shared 04/04/2020

04:16

Pumping Lemma for Regular Languages PROOF IN 4 MINUTES - Easy Theory

Easy Theory

Shared 03/04/2020

09:25

Which of these languages is regular? Surprising answer!

Easy Theory

Shared 13/03/2020

06:48

How to Formally Analyze a DFA (Q, Sigma, delta, q0, F)

Easy Theory

Shared 04/03/2020