I & Unacademy is here to make your GATE Preparation Easier....So Go through it and enjoy your trip toward your success..


Naman Agarwal

This course deals with the construction of Finite Automata... simple tricks which make easy to construct any Finite Automata.

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) Construction of DFA - GATE(CS and IT)

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

Definition and comparisons between DFA,NFA &€-NFA. at any type of confusion you can dm me or comment below.

Course Overview (in Hindi)

In this video we are doing example of acceptance of even length of string,binary no. Acceptance &even no. Of a in a string...

Construction of DFA(Example 1) (in Hindi)

In this video we are solving example of DFA on odd no.of b,atmost 2, starting and ending with same Symbol?...

Construction of DFA(Example-2) (in Hindi)

In this video we are talking about start and end with different symbols, divisible by 3,and a follow by b?..

Construction of DFA(Example-3) (in Hindi)

This video contains questions of union question as divisible by 3 OR divisible by 2 and intersection question as binary to decimal divisible by 2 and divisible by 3 ?

DFA (Union and Intersection Concept) (in Hindi)

Here we talk about questions of changing €-nfa to nfa and NFA on starting with 0 and containing substring of 000.

Construction of NFA (in Hindi)

8+ Years Teaching Exp. in GATE CS IT & PLACEMENTS on Unacademy | Mentored 2 Lakh+ Students | Students secured AIR Below 100 in GATE 

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 , 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)

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

6 lessons • 1h 21m

Invalid Date

NaN

Course Overview (in Hindi)

Invalid Date

NaN

Construction of DFA(Example 1) (in Hindi)

Invalid Date

NaN

Construction of DFA(Example-2) (in Hindi)

Invalid Date

NaN

Construction of DFA(Example-3) (in Hindi)

Invalid Date

NaN

DFA (Union and Intersection Concept) (in Hindi)

Invalid Date

NaN

Construction of NFA (in Hindi)