Theory of Computation

Introduction of TOC and Finite Automata

1
TOC Lec. 1.1 Introduction Of TOC
01:10:20
2
TOC Lec. 1.2 Alphabet And Strings
44:18
3
TOC Lec. 1.3 Prefix,Suffix,Power Of Alphabet
42:44
4
TOC Lec. 1.4 Language And Set
52:39
5
TOC Lec.1.5 Regular Language And NFA
01:05:05
6
TOC Lec.1.6 Conversion Of NFA to DFA And Minimization
01:01:58
7
TOC Lec.1.7 Theory Of DFA
44:31
8
TOC Lec. 1.8 Minimal DFA Solved Problems
55:54
9
TOC Lec.1.9 Minimal DFA Solved Problems
01:00:50
10
TOC Lec.1.10 Minimal DFA Solved Problems
01:01:30
11
TOC Lec.1.11 Minimal DFA Solved Problems
53:19
12
TOC Lec.1.12 Epsilon NFA
47:24
13
TOC Lec. 1.13 Conversion Of Epsilon NFA To NFA, Epsilon NFA To DFA
01:05:50
14
TOC Lec.1.14 Minimal DFA Solved Problems
45:52
15
TOC Lec. 1.15 Compound Finite Automata
52:58
16
TOC Lec.1.16 Compound Finite Automata
49:36
17
TOC Lec 1.17 Decision Properties Of Finite Automata
50:01
18
TOC Lec.1.18 Minimization Of DFA
1:06:17
19
TOC Lec.1.19 Designated Initial State DFA’s
39:45
20
TOC Lec.1.20 Moore And Mealy Machine
1:28:24

Regular Expression

1
TOC Lec. 2.1 Basic Of Regular Expression
59:03
2
TOC Lec. 2.2 Regular Expression Solved Problems
42:24
3
TOC Lec. 2.3 Equivalence Of FA And Regular Expressions
37:34
4
TOC Lec. 2.4 Transition Graph & State Elimination Method
57:26
5
TOC Lec. 2.5 Equivalence Of Regular Expressions & Finite Automata
58:37
6
TOC Lec.2.6 Algebraic Properties of ‘RE’ & Closure Property of ‘RL’ Part-1
1:05:50
7
TOC Lec. 2.7 Closure Property Of ‘RL’ Part-2
59:18
8
TOC Lec.2.8 Closure Property Of ‘RL’ Part-3
58:57
9
TOC Lec. 2.9 Pumping Lemma
33:48

Regular Grammar

1
TOC Lec.3.1 Grammar Introduction
47:15
2
TOC Lec.3.2 Grammar Costruction Solved Problems
49:39
3
TOC Lec.3.3 Chomsky Hierarchy & Regular Grammar
1:04:20

CFG CFL PDA

1
TOC Lec.4.1 Introduction & Simplifaction Of CFG
45:08
2
TOC Lec. 4.2 CNF & GNF
1:23:56
3
TOC Lec. 4.3 Decision Properties of CFL
40:54
4
TOC Lec. 4.4 Pushdown Automata (PDA)
34:15
5
TOC Lec. 4.5 PDA Construction Solved Problems
1:28:07
6
TOC Lec.4.6 Closure Properties of DCFL and CFL
1:16:54
7
TOC Lec.4.7 Conversion of CFG to PDA and PDA to CFG and Pumping Lemma of CFL
47:55

Turing Machine and Undecidability

1
TOC Lec. 5.1 Introduction of Turing Machine
32:55
2
TOC Lec. 5.2 Construction of Turing Machine
45:23
3
TOC Lec. 5.3 Closure Property of Recursive And RE Set And CSL
41:16
4
TOC Lec. 5.4 Universal TM and Reducibility and PCP and RICE Theorem
49:25

Summary

1
TOC Lec. 6.1 Summary of Chomsky Hierarchy and Closure Properties and Decidability
26:21
2
TOC Lec. 6.2 Detection of Regular and CFL
43:26
5
5 out of 5
1 Ratings

Detailed Rating

Stars 5
1
Stars 4
0
Stars 3
0
Stars 2
0
Stars 1
0

{{ review.user }}

{{ review.time }}
 

Show more
Please, login to leave a review
Add to Wishlist
Enrolled: 16 students
Lectures: 45