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 )

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) Theory of Computation-Finite Automata (Part-2)

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

Epsilon NFA.... Its the 3rd type of finite Automata without output

Epislon-NFA (in Hindi)

Empty(Epsilon-NFA) Example (in Hindi)

Moore Machine (in Hindi)

Moore Machine example

Mealy Machine (in Hindi)

Moore to Miley Conversion (in Hindi)

Miley to Moore Conversion (in Hindi)

Prodct of Automata (in Hindi)

Language is Regular or Not ? (in Hindi)

Language is Regular or Not (Part-2) (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 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

This course contains the detailed study of Finite Automata which is an important topic in TOC. This course make you a master of DFA and NFA in a very less time.

(Hindi) Finite Automata (TOC) for GATE CS and IT

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)

MCA from NIT Agartala, passionate for sharing knowledge

Bharat Verma

This course will give the learners understanding of formal language and automata theory, to know the importance of Deterministic Finite Automata (DFA) and how to draw a DFA

(Hindi) Deterministic Finite Automata

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

10 lessons • 1h 46m

Invalid Date

NaN

Epislon-NFA (in Hindi)

Invalid Date

NaN

Empty(Epsilon-NFA) Example (in Hindi)

Invalid Date

NaN

Moore Machine (in Hindi)

Invalid Date

NaN

Moore Machine example

Invalid Date

NaN

Mealy Machine (in Hindi)

Invalid Date

NaN

Moore to Miley Conversion (in Hindi)

Invalid Date

NaN

Miley to Moore Conversion (in Hindi)

Invalid Date

NaN

Prodct of Automata (in Hindi)

Invalid Date

NaN

Language is Regular or Not ? (in Hindi)

Invalid Date

NaN

Language is Regular or Not (Part-2) (in Hindi)