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.

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: Minimal DFA or Minimization Of DFA

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

Minimization Of DFA Part-1 Basics (in Hindi)

Minimization Of DFA Part-1 (in Hindi)

Minimization Of DFA Part 2 step 1 of drawing table.

Minimization Of DFA / Minimal DFA Part 2 (in Hindi)

Minimization Of DFA Part-3 (in Hindi)

Minimization Of DFA Example 2 ( in Hindi)

Minimization Of DFA Example Part 2 (in Hindi)

Minimization Of DFA Example 2 Part-2 (in Hindi)

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 will cover Short Tricks for Writing Regular Expressions with Master SRP.

(Hindi) Short Tricks for Writing Regular Expressions with Master SRP : GATE (CS and IT)

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.

Theory of Computation(TOC) - GATE 2019

This course contains the detailed study of Finite Automata which is an important topic in TOC. This course make you a master of DFA and NFA in a very less time.

(Hindi) Finite Automata (TOC) for GATE CS and IT

M.Tech @ NSIT Delhi/GATE (CS) 2017&2018 qualified ...Not a teacher but a medium of sharing my knowledge 

Akshay Mandhare

This course is second part of finite Automata, in this course we will learn about Epsilon-NFA,FA with output(Mealy&Moore machine )

(Hindi) Theory of Computation-Finite Automata (Part-2)

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)

I am a self motivated person with a positive attitude towards life and work. My dream is to work in a professional environment.

Shivam Pandey

In this course we will cover some important topics of CHOMSKY HIERARCHY and CHOMSKY NORMAL FORM.

Lessons

5 lessons • 45m

Invalid Date

NaN

Minimization Of DFA Part-1 (in Hindi)

Invalid Date

NaN

Minimization Of DFA / Minimal DFA Part 2 (in Hindi)

Invalid Date

NaN

Minimization Of DFA Part-3 (in Hindi)

Invalid Date

NaN

Minimization Of DFA Example 2 ( in Hindi)

Invalid Date

NaN

Minimization Of DFA Example 2 Part-2 (in Hindi)