Theory of Computation

To get more free video and resources click here

Key Features and Syllabus covered

What is this Subject about?

Curriculum

1 # Introduction to TOC,Finite Automata

02:00:19

2 # Deterministic Finite Automata (DFA)

01:58:46

3 # Deterministic Finite Automata (DFA)

02:02:32

4 # DFA,Expressive Power

01:55:09

5 # Complement of Finite Automata, design issues of FA

01:51:53

6 # Conversion of NFA to DFA & Epsilon NFA to NFA

02:02:30

7 # Minimization of DFA

01:36:27

8 # Regular Expression

02:00:57

9 # Regular Expression

01:57:15

10 # Conversion of Regular Expression to FA & FA to Regular Expression

01:55:04

11 # Regular Language and Pumping Lemma

01:58:04

12 # Decision Properties of FA

02:03:41

13 # Closure Property of Regular Language

01:50:31

14 # Mealy and Moore Machine

02:02:32

15 # Grammar,Chomsky Classification of Grammar

02:32:31

16 # Simplification of CFG,Normal Form of CFG

01:55:06

17 # Decision Problem of CFG, Closure Property of CFG

01:53:03

19 # Edited Video - Decision Problem of CFG, Closure Property of CFG

05:09:32

20 # Edited Video - Decision Problem of CFG, Closure Property of CFG

05:09:32

18 # PDA,How to check language is CFL or not

02:02:07

19 # Turing Machine

00:08:32

20 # Turing Machine

01:47:31

21 # Turing Machine

01:19:14

22 # Doubt session

01:52:05

Subscription pack 1 Months- Theory of Computation

Rs 500

    15 Number of videos

    30 Hours of lectures

    15 Learners

     24x7 Online Access


Achieve your career dreams, wherever you are, whenever you want!

ABOUT US

Nimbus is an online learning platform for Engineering graduates who are preparing for competitive exams like ESE,GATE,PSU,SSC -JE and other JE and AE exams.

ADDRESS
Khasra 262, Westend Marg, Near Garden of Five Senses, Saket, New Delhi, India 110030

CONTACT US
[email protected]
+91 7374000888, +91 7374000999