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)

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

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)