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 , I will cover GATE Previous Year Questions On Regular Languages & Finite Automata With Detailed Analysis.

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) GATE PYQs: Regular Languages & Finite Automata

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

Strategy To Crack Regular Languages & FA (in Hindi)

GATE Problem : 1 (in Hindi)

GATE Problem: 2 & 3(in Hindi)

GATE Problem: 4 & 5 (in Hindi)

GATE Problem: 6 & Useful Tricks For Identities (in Hindi)

This lesson will cover Revise In 15 Minutes Regular Languages & FA.

Revise In 15 Minutes : Regular Languages & FA (in Hindi)

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)

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

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

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)

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

6 lessons • 1h 18m

Invalid Date

NaN

Strategy To Crack Regular Languages & FA (in Hindi)

Invalid Date

NaN

GATE Problem : 1 (in Hindi)

Invalid Date

NaN

GATE Problem: 2 & 3(in Hindi)

Invalid Date

NaN

GATE Problem: 4 & 5 (in Hindi)

Invalid Date

NaN

GATE Problem: 6 & Useful Tricks For Identities (in Hindi)

Invalid Date

NaN

Revise In 15 Minutes : Regular Languages & FA (in Hindi)