Lec-18: Eliminate Epsilon ε-moves | Conversion from epsilon nfa to nfa

preview_player
Показать описание

Here is the explanation of Eliminate Epsilon ε-moves and Conversion from epsilon nfa to nfa. It is explained step by step.

0:00 -Introduction
1:14 -Eliminate Epsilon ε-moves

►Theory of Computation (Complete Playlist):

Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
►Design and Analysis of algorithms (DAA):
►Database Management System:
► Software Engineering:
►Artificial Intelligence:
►Computer Networks:
►Operating System:
►Structured Query Language (SQL):
►Discrete Mathematics:
►Compiler Design:
►Number System:
►Cloud Computing & BIG Data:
►Programming in C :
►Data Structure:
►Computer Architecture :
►Graph Theory (Complete Playlist):
►Digital Logic:

---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:
Рекомендации по теме
Комментарии
Автор

Definiation of Epsilon is on Lecture 25 of this playlist

aliakbar
Автор

ANNA BIG FAN ANNA.THERE IS NO TEACHER IN OUR COLLEGE WHO EXPLAINED ATFL IN SUCH A EASY MANNER LIKE YOU .I AM ABLE TO PASS IN MY SEM EXAM ONLY BECAUSE OF YOUR EXPLAINATIONS.THANKYOU SO MUCH ❤

jayasreemedandrao
Автор

Sir thanku u so much, aaj main sirf aapke channel par sukrana karne aaya hu, meri bsc computer science degree complete ho chuki h or aapke dwara diye gye lecture se main computer me achhe marks se paas huaa hu #thanku sir luv u❤❤ or aap bhi apni life me khus or successful ho ye dua h hmari🥰🥰

ManpreetSingh-qtvt
Автор

bhai this sir is god!! i am ssly thinking agar aap nahi hote to mai college mai passs kaise hota! amazing sir!!1 <3

Hriviewer
Автор

I really couldn't imagine my life without you. Thanks a lot ❤❤

adityadhal
Автор

god bless you ..you are doing such a amazing job sir..we really need a teacher like you...we all truley blessed.

happycoding
Автор

This method is very confusing. I tried to solve other questions but I was not able to do it. In GATE exam, this method is impractical as it will consume most of the time.

harshilshah
Автор

hello sir....mein Kerala se hun...aapki videos dekhne ki wajah se mujhe har ek exams mein ache marks mil rahi hai . Even hamare TOC ke teacher bhi aapke channel subscribe kar chuke hai ..before 2 years..Bcz ...You are really Awesome sir....Keep going...All the best..👍👍👍👍👍👍🔥🔥🔥🔥🔥🔥🔥🔥🤩🤩🤩🤩🤩🤩🤩🤩

thohfa
Автор

I learned all btech sibjects from your lectures thank you sir

ayyappareddy
Автор

I watched so many videos bcz i couldn't find yrs in this topic, but couldn't understand a single thing there but through thisss 2/3 mins only and im ✅

rameensheikh
Автор

Sir I regularly watch ur lectures only I really learnt a lot from u sir it is very useful tq✨

lakshmipathakamuri
Автор

Mere college mai bas teacher name ka hai.. padhana toh unko kuch aana nhi hai.. is se million times better aap ho... Very well explained sir each n every topic ✨ from your lectures now I know what is automata.. otherwise I think that it's boring subject 😩 but now it's very interesting subject thankyou so much sir 😊✨

khushbusahani
Автор

Thanks sir for making TOC very easy for us 🙏

sonurathee
Автор

All those are having doubt make correction :
At the last moment sir forget to remove initial state symbol from q0 and as well as he forget to erase q0 and q2 as q0 is unreachable state so we can't even reach q2 as well, so
So only the valid states are q1 q3 q5 q6


I hope you all got it ☺

loluni
Автор

Sir, one doubt is there...
How possible more than one initial state in finite automata... Because generally only one initial state possible in finite automata..!

kevalkathiriya
Автор

Thanks a lot sir, watching one day before exam ❤😂

Education_hub
Автор

Sir, in NFA or DFA, we have only one initial state ( Q, q0, F, delta, . sigma). So, why is there more than one initial state??
e-NFA to NFA can be transformed with the help of epsilon closure method, there no more than one initial state is coming!!! Please reply and explain Sir.

suvankar
Автор

varun singla respect++;
for infinity times
great way of teaching
thank you so much sir

mukulchopra
Автор

Wao sir bhaut acha explain keratae he Aap

ankitbaba
Автор

Thanks a lot !!! love from tamilnadu♥♥♥

vishnumuralidhar