Lesson 5 of 32 • 28 upvotes • 15:00mins
Introduction to the finite automata.
32 lessons • 5h 35m
Introduction to the Course - Theory of Computation (in Hindi)
11:15mins
Origin of Theory of Computation/ TOC (in Hindi)
7:53mins
Basics Concept (Alphabet, Strings) in Theory of Computation (in Hindi)
14:21mins
Basics Concept (Language) in Theory of Computation (in Hindi)
8:28mins
Introduction to Finite Automata in Theory of Computation (in Hindi)
15:00mins
DFA notation - TOC - NTA UGC NET Computer Science
9:44mins
Numericals on DFA - part 1- NTA UGC NET Computer Science
8:59mins
Numericals on DFA part 2 - NTA UGC NET Computer Science
6:44mins
Numericals on DFA part 3 - NTA UGC NET Computer Science
11:42mins
Solution to practice question 1- NTA UGC NET Computer Science
12:15mins
Solution to practice question 2
11:25mins
Solution to practice question 3- NTA UGC NET Computer Science
7:02mins
Union of DFA in TOC- NTA UGC NET Computer Science
6:24mins
Concatenation of DFA - NTA UGC NET Computer Science
5:20mins
Complementation of DFA in TOC - NTA UGC NET Computer Science
7:02mins
Reversal of DFA in TOC- NTA UGC NET Computer Science
6:04mins
Introduction to NFA in TOC- NTA UGC NET Computer Science
11:05mins
How to convert NFA into DFA in TOC- NTA UGC NET Computer Science and GATE CSE
14:00mins
Example NFA to DFA part 2- NTA UGC NET Computer Science and GATE CSE
10:44mins
Introduction to the epsilon- NFA.
11:05mins
How to convert epsilon- NFA to NFA in TOC- NTA UGC NET Computer Science.
13:37mins
Minimization of DFA in TOC- NTA UGC NET Computer Science and GATE CSE
10:26mins
Example of minimization of DFA in TOC- NTA UGC NET computer science
11:52mins
Example of Minimization of DFA in TOC- NTA UGC NET Computer Science.
9:08mins
Introduction to the Finite State Machine - Moore and Mealy machine
15:00mins
Introduction to Finite State Machine - Moore and Mealy Machine pà rt 2
10:14mins
Conversion of Moore to Mealy Machine in TOC for NTA UGC NET Computer Science
7:31mins
Conversion of Mealy to Moore Machine in TOC for NTA UGC NET Computer Science
11:54mins
Solution to previous years questions based on Finite automata
12:53mins
Solution to previous years questions based on Finite Automata part 2
8:44mins
Solution to previous years questions of Theory of Computation
15:00mins
Solution to previous years questions based on Theory of Computation
12:15mins