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

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.

(Hindi) Moore/Mealy Machine and Conversion of FA to Other FA

5

Naman Agarwal

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

Similar courses

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

4.6

(Hindi) Part 1: Minimal DFA or Minimization Of DFA

5

Theory of Computation(TOC) - GATE 2019

4.9

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

5

(Hindi) Finite Automata in TOC - GATE (CS/IT)

4.7

(HINDI) Theory of Computation: Chomsky Hierarchy and Chomsky Normal Form

4.1

No internet connection