11:05

The DFA Product Construction Ruins Everything!

Easy Theory

Shared 01/05/2020

13:08

What are sets (in theory of computation)?

Easy Theory

Shared 30/04/2020

14:07

Closure Properties of Context-Free Languages

Easy Theory

Shared 21/04/2020

06:04

Number of Final States in Product Construction

Easy Theory

Shared 13/04/2020

06:14

Context-Free Grammar for {0^n 1^n 2^m 3^m} U {0^n 1^m 2^m 3^n}

Easy Theory

Shared 10/04/2020

11:15

Infinite DFAs (and showing it is decidable!)

Easy Theory

Shared 07/04/2020

06:19

How to check if a DFA satisfies a specification (SUB_DFA)!

Easy Theory

Shared 05/04/2020

05:04

Does the NFA to DFA conversion always make more states?

Easy Theory

Shared 28/03/2020

06

Useless States in a DFA is Decidable!

Easy Theory

Shared 04/04/2020

15:44

Context-Free Languagess are Closed Under Intersection with Regular Languages

Easy Theory

Shared 29/03/2020

09:25

Which of these languages is regular? Surprising answer!

Easy Theory

Shared 13/03/2020

07:04

DFAs for Sigma*, Empty Set, and More

Easy Theory

Shared 06/03/2020

04:48

Deterministic Finite Automaton for a*b*c*

Easy Theory

Shared 05/03/2020

06:48

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

Easy Theory

Shared 04/03/2020

11:57

Deterministic Finite Automaton to Turing Machine Conversion (DFA to TM) - Easy Theory

Easy Theory

Shared 09/11/2021

47:28

Regular Expressions -- Intro Theory of Computation Help Session #4

Easy Theory

Shared 10/09/2021

16:03

What You Need To Know About ROBOTS And The AUTOMATA PART 2

WoodwardTV

Shared 30/10/2020

17:17

What You Need To Know About ROBOTS And The AUTOMATA PART I

WoodwardTV

Shared 26/10/2020