Thumbnail
Hindi

(Hindi) Theory of Computation Problems - Part 2 for GATE Aspirants

4.6

5 ratings

Shivam Pandey

In this course Shivam will cover some important questions on Regular Expression, PDA, Turing Machine etc.

Lessons

19 lessons • 3h 29m
Invalid Date

NaN

Epsilon NFA or NULL- NFA (in Hindi)

13m 55s

Invalid Date

NaN

Epsilon NFA to NFA Conversion: Part 1 (in Hindi)

10m 06s

Invalid Date

NaN

Epsilon NFA to NFA Conversion Part 2 (in Hindi)

11m 11s

Invalid Date

NaN

Epsilon NFA to NFA Conversion: Part 3 (in Hindi)

10m 51s

Invalid Date

NaN

Regular Language: Part 1 (in Hindi)

12m 28s

Invalid Date

NaN

Regular Language: Part 2 (in Hindi)

10m 17s

Invalid Date

NaN

Regular Language: Part 3 (in Hindi)

10m 42s

Invalid Date

NaN

Regular Language: Part 4 (in Hindi)

9m 48s

Invalid Date

NaN

Regular Expression: Part 1 (in Hindi)

11m 38s

Invalid Date

NaN

Regular Expression: Part 2 (in Hindi)

12m 44s

+ See all lessons

Similar courses

warningNo internet connection