Please Login To Continue

Origin of Theory of Computation/ TOC (in Hindi)

Lesson 2 of 32 • 43 upvotes • 7:53mins

Avatar

Rashmi Vishwakarma

Why to learn Theory of computation. Relationship between finite automata and Computer Science.

Continue on app
1

Introduction to the Course - Theory of Computation (in Hindi)

11:15mins

2

Origin of Theory of Computation/ TOC (in Hindi)

7:53mins

3

Basics Concept (Alphabet, Strings) in Theory of Computation (in Hindi)

14:21mins

4

Basics Concept (Language) in Theory of Computation (in Hindi)

8:28mins

5

Introduction to Finite Automata in Theory of Computation (in Hindi)

15:00mins

6

DFA notation - TOC - NTA UGC NET Computer Science

9:44mins

7

Numericals on DFA - part 1- NTA UGC NET Computer Science

8:59mins

8

Numericals on DFA part 2 - NTA UGC NET Computer Science

6:44mins

9

Numericals on DFA part 3 - NTA UGC NET Computer Science

11:42mins

10

Solution to practice question 1- NTA UGC NET Computer Science

12:15mins

11

Solution to practice question 2

11:25mins

12

Solution to practice question 3- NTA UGC NET Computer Science

7:02mins

13

Union of DFA in TOC- NTA UGC NET Computer Science

6:24mins

14

Concatenation of DFA - NTA UGC NET Computer Science

5:20mins

15

Complementation of DFA in TOC - NTA UGC NET Computer Science

7:02mins

16

Reversal of DFA in TOC- NTA UGC NET Computer Science

6:04mins

17

Introduction to NFA in TOC- NTA UGC NET Computer Science

11:05mins

18

How to convert NFA into DFA in TOC- NTA UGC NET Computer Science and GATE CSE

14:00mins

19

Example NFA to DFA part 2- NTA UGC NET Computer Science and GATE CSE

10:44mins

20

Introduction to the epsilon- NFA.

11:05mins

21

How to convert epsilon- NFA to NFA in TOC- NTA UGC NET Computer Science.

13:37mins

22

Minimization of DFA in TOC- NTA UGC NET Computer Science and GATE CSE

10:26mins

23

Example of minimization of DFA in TOC- NTA UGC NET computer science

11:52mins

24

Example of Minimization of DFA in TOC- NTA UGC NET Computer Science.

9:08mins

25

Introduction to the Finite State Machine - Moore and Mealy machine

15:00mins

26

Introduction to Finite State Machine - Moore and Mealy Machine pàrt 2

10:14mins

27

Conversion of Moore to Mealy Machine in TOC for NTA UGC NET Computer Science

7:31mins

28

Conversion of Mealy to Moore Machine in TOC for NTA UGC NET Computer Science

11:54mins

29

Solution to previous years questions based on Finite automata

12:53mins

30

Solution to previous years questions based on Finite Automata part 2

8:44mins

31

Solution to previous years questions of Theory of Computation

15:00mins

32

Solution to previous years questions based on Theory of Computation

12:15mins

Crack NTA-UGC-NET & SET Exams with Unacademy

Get subscription and access unlimited live and recorded courses from India's best educators
Structured syllabus
Structured syllabus
Daily live classes
Daily live classes
Ask doubts
Ask doubts
Tests & practice
Tests & practice

More from Rashmi Vishwakarma

thumbnail
HindiPractice & Strategy

Practice Session on 2018 Previous Year Paper II

Rashmi Vishwakarma

Similar Plus Courses

Unacademy is India’s largest online learning platform. Download our apps to start learning


Starting your preparation?

Call us and we will answer all your questions about learning on Unacademy

Call +91 8585858585
Company
About usShikshodayaCareersBlogsPrivacy PolicyTerms and Conditions
Products
Learner appLearner appEducator appEducator appParent appParent app