
I have got an  NPTEL elite certificate in Data structure using C and also gold medalist in Joy of computing with python. 


Alok Dixit

The theory of computation deals with how effectively problem can be solved on a model of computation, using algorithm

GATE (Graduate Aptitude Test in Engineering) 2020 & 2021 complete preparation with best educators. Know about the detailed syllabus, best books, exam pattern and dates, previous year question papers a

GATE - Iconic Pro

Hindi

(Hindi) Part 1: Theory of Computation

Theory of Computation

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

In this lesson we will discuss about overview of this course.

Overview of Course ( in Hindi)

In this lecture we learn some prerequisites of finite state machine.

Introduction of Theory of computation - Finite state machine ( prerequisites) (in Hindi)

In this lesson we learnt about finite state machine, classification of finite state machine and DFA

Finite automata - DFA (in Hindi)

In this lesson we learn how we construct DFA

Examples of DFA - 1st part (in Hindi)

In this lecture we learnt more examples of DFA that how can we construct DFA from the given language

Examples of DFA -2nd part (In Hindi)

In this lecture , We learn about the some basic points of NFA.

NFA - Non deterministic Finite Automata (In hindi)

In this lecture , we learn the Formal definition of NFA. By the formal definition we define the NFA

Formal definition of NFA (In hindi)

In this lesson , we learn how to construct NFA for the given language.

Construction of NFA- Examples (part 1) In hindi

In this lecture , we learn how to construct NFA for the given language.

Construction of NFA - Examples ( part 2) In hindi

In this lecture , we learn how to construct NFA for the given language. In this lecture we see more examples.

Construction of NFA - Examples (part 3) In hindi

In this lecture we learn how to minimize the DFA.

Minimization of DFA ( in hindi)

In this lecture we learn how we can minimize any DFA. In this lecture we show a example on minimization of DFA

Minimization of DFA Example (In hindi)

In this lecture we learn how to convert NFA to its equivalent DFA.

Conversion from NFA to DFA (In hindi)

In this lecture we learn  how to convert NFA to its equivalent DFA.

Conversion of NFA to DFA Examples ( In hindi)

In this lecture we discuss the example, how to convert NFA to its equivalent DFA

Conversion of NFA to DFA example (in hindi)

In this lecture we learn how to convert from NFA to DFA.

Coversion of NFA to DFA (In Hindi)

In this Course we learn how we construct such machines which gives output. In this we learn how the machine run with associated output for Gate exam Aspirants.

(Hindi) Theory of Computation with Output

AWS Cloud Support Associate(Networking); B.Tech-IT from Maharaja Surajmal Institute of Technology.

Payal Gupta

In this course, the educator is Describing basic concepts of TOC which is helpful for GATE Aspirants.

Introduction To TOC: GATE

A Mechanical  Engineer by profession and a Computer Science Enthusiast by heart. I love working on scientific and numerical computation.

Vishwesh Ravi Shrimali

This course is for people who want to learn MATLAB to apply it in any project and that too in a short time. The course will cover the basics of MATLAB using examples from various domains

(Hindi) Introduction to MATLAB

Mentored 81,000+ Students | My Multiple Students secured AIR Below 100 in GATE | Joined top IISc, IITs & NITs | Joined PSUs | 5+ Years Exp.

Sweta Kumari

In this course, Sweta Kumari discusses some key concepts of Theory of Computation with Short Tricks. The course will be beneficial for GATE aspirants.

(Hindi) Short Tricks for Theory of computation for GATE 2018

BE , ME (Computer Science Engineering)
3 years of Experience in teaching Engineering students.

Rachana Pathak

In this course, the educator discusses the Minimization Of DFA or Minimal DFA. The course will be beneficial for GATE Aspirants.

(Hindi) Part 1: Minimal DFA or Minimization Of DFA

I am pursuing M.tech from Lovely professional University in CSE.I have other talent which is Trading.

Nikhil Ravi

In this course, educator will be teaching about
Theoretical computer science (TCS) is a subset of general computer science and mathematics that focuses on more mathematical topics of computing and includes the theory of computation. It is difficult to circumscribe the theoretical areas precisely.

Lessons

16 lessons • 2h 40m

Invalid Date

NaN

Overview of Course ( in Hindi)

Invalid Date

NaN

Introduction of Theory of computation - Finite state machine ( prerequisites) (in Hindi)

Invalid Date

NaN

Finite automata - DFA (in Hindi)

Invalid Date

NaN

Examples of DFA - 1st part (in Hindi)

Invalid Date

NaN

Examples of DFA -2nd part (In Hindi)

Invalid Date

NaN

NFA - Non deterministic Finite Automata (In hindi)

Invalid Date

NaN

Formal definition of NFA (In hindi)

Invalid Date

NaN

Construction of NFA- Examples (part 1) In hindi

Invalid Date

NaN

Construction of NFA - Examples ( part 2) In hindi

Invalid Date

NaN

Construction of NFA - Examples (part 3) In hindi

+ See all lessons