MCA from NIT Agartala, passionate for sharing knowledge

Bharat Verma

This course will help the learners to give the proper understanding of Non-Deterministic Finite Automata (NFA) and explain them how to draw a NFA and convert them into DFA

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) Non- Deterministic Finite Automata

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

This lesson will help the learners to understand the basic concept of NFA and difference between a DFA and a NFA.

1. Basics Of Non - Deterministic Finite Automata (in Hindi)

This lesson will help the learners to understand the significance of NFA and its real life applications.

2. Significance Of NFA And Its Real Life Applications (in Hindi)

This lesson will help the learners to understand how to draw a Non - Deterministic Finite Automata (NFA) on some problems and how it is different with its corresponding DFA.

3. How To Draw A Non - Deterministic Finite Automata (NFA) (in Hindi)

This lesson will give the learners proper understanding of drawing a NFA for some important problems.

4. Important Examples Of Non - Deterministic Finite Automata (NFA) (in Hindi)

This lesson will help the learners to understand how to convert an NFA to a DFA by some important examples and also the difference of DFA and NFA in terms of transition function

5. Conversion Of Non-Deterministic Finite Automata (NFA) To Deterministic Finite Automata (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

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

5 lessons • 1h

Invalid Date

NaN

1. Basics Of Non - Deterministic Finite Automata (in Hindi)

Invalid Date

NaN

2. Significance Of NFA And Its Real Life Applications (in Hindi)

Invalid Date

NaN

3. How To Draw A Non - Deterministic Finite Automata (NFA) (in Hindi)

Invalid Date

NaN

4. Important Examples Of Non - Deterministic Finite Automata (NFA) (in Hindi)

Invalid Date

NaN

5. Conversion Of Non-Deterministic Finite Automata (NFA) To Deterministic Finite Automata (in Hindi)