Lesson 1 of 16 • 14 upvotes • 3:11mins
In this lesson we will discuss about overview of this course.
16 lessons • 2h 40m
Overview of Course ( in Hindi)
3:11mins
Introduction of Theory of computation - Finite state machine ( prerequisites) (in Hindi)
10:31mins
Finite automata - DFA (in Hindi)
12:49mins
Examples of DFA - 1st part (in Hindi)
10:22mins
Examples of DFA -2nd part (In Hindi)
11:58mins
NFA - Non deterministic Finite Automata (In hindi)
9:06mins
Formal definition of NFA (In hindi)
12:18mins
Construction of NFA- Examples (part 1) In hindi
10:50mins
Construction of NFA - Examples ( part 2) In hindi
9:22mins
Construction of NFA - Examples (part 3) In hindi
10:44mins
Minimization of DFA ( in hindi)
8:47mins
Minimization of DFA Example (In hindi)
13:22mins
Conversion from NFA to DFA (In hindi)
9:29mins
Conversion of NFA to DFA Examples ( In hindi)
8:44mins
Conversion of NFA to DFA example (in hindi)
9:41mins
Coversion of NFA to DFA (In Hindi)
9:37mins