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


Naman Agarwal

In this we study about Minimization of DFA and And see how one FA convert to another FA.

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) Moore/Mealy Machine and Conversion of FA to Other FA

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

Course Overview (in Hindi)

In this we discuss about partition method for minimization of a DFA.

Minimization of DFA (in Hindi)

In this we discuss about two examples in which we convert NFA to DFA

Conversion of NFA to DFA (in Hindi)

In this we generate FA with Output...as Moore Machine

Moore Machine (in Hindi)

In this we discuss about some examples on mealy Machine.

Mealy Machine (in Hindi)

In this we orally discuss about the conversion of mealy Machine to Moore Machine and Vice versa

Conversion of Moore to mealy Machine

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 7m

Invalid Date

NaN

Course Overview (in Hindi)

Invalid Date

NaN

Minimization of DFA (in Hindi)

Invalid Date

NaN

Conversion of NFA to DFA (in Hindi)

Invalid Date

NaN

Moore Machine (in Hindi)

Invalid Date

NaN

Mealy Machine (in Hindi)

Invalid Date

NaN

Conversion of Moore to mealy Machine