BE in Computer Science
Pursuing ME in CSE
Cleared GATE 2017 and 2018

Priyanka Bhati

This course is a crash course of TOC. TOC is a very important subject in GATE CS and IT and it can be mastered with this course. This contains theoritical explanation of each topic and also the solutions of previous year GATE questions of TOC.

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

English

Theory of Computation(TOC) - GATE 2019

Finite Automata

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

This lesson contains the introduction of TOC qnd the definition of deterministic and non deterministic machines.

Introduction to TOC

This lesson contains some important definitions to be used in the course and important operations on strings.

Operations on Strings

This lesson explains kleen closure and positive closure

Kleen Closure and Positive Closure

This lesson contains information about tuples of DFA and properties of DFA.

DFA (Deterministic Finite Automata)

This lesson contains the explanation of states of dfa ( productive and non productive states ) as well as types of non productive states.

Types of States in DFA (Productive and Non-Productive States)

This lesson explains the steps for dfa formation with the help of examples.

Steps To Draw DFA (With Examples)

This lesson contains high level dfa questions important for GATE. Few basic concepts are also covered in this.

Drawing Complex DFA

This lesson contains the introduction of NFA and few key points of NFA

NFA(Non Deterministic Finite Automata)

This lesson contains the examples of NFA and explains the steps to draw NFA

Steps To Draw NFA ( With Examples )

This lesson contains conversion of NFA to DFA

NFA To DFA ( With Examples )

This lesson explains null NFA and conversion of null NFA to NFA

Null NFA ( Epsilon NFA )

Minimization Of DFA

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

This course will go through you some tips & tricks to Solve Regular Expression For Finite Automata. Firstly, I have discussed Regular Expression Examples , Identities & Example Problems, Arden's Theorem, NFA to Regular Expression Conversion,DFA to Regular Expression Conversion.

(Hindi) Tips & Tricks For Regular Expressions in TOC: GATE

This course will let you know the difference between Deterministic Finite Automata (DFA) and Non - Deterministic Finite Automata (NFA) with examples. This course also explains you some of  the key points that will helpful for your Exams.

(Hindi) Finite Automata in TOC - GATE (CS/IT)

In this course , I will cover GATE Previous Year Questions On Regular Languages & Finite Automata With Detailed Analysis.

(Hindi) GATE PYQs: Regular Languages & Finite Automata

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.

Theory of Computer Science - GATE (CS and IT)

In this course, Sweta Kumari will explain about Context-free Grammar and how to create them, Push down automata and its types and many more.

Lessons

12 lessons • 2h 9m

Invalid Date

NaN

Introduction to TOC

Invalid Date

NaN

Operations on Strings

Invalid Date

NaN

Kleen Closure and Positive Closure

Invalid Date

NaN

DFA (Deterministic Finite Automata)

Invalid Date

NaN

Types of States in DFA (Productive and Non-Productive States)

Invalid Date

NaN

Steps To Draw DFA (With Examples)

Invalid Date

NaN

Drawing Complex DFA

Invalid Date

NaN

NFA(Non Deterministic Finite Automata)

Invalid Date

NaN

Steps To Draw NFA ( With Examples )

Invalid Date

NaN

NFA To DFA ( With Examples )

+ See all lessons