Thank you. I've learned a lot from you videos. The sound is clear, your accent is very understandable and the way you explain helps with writing apps that use the algorithms. Great job!
Just a quick thanks, I've been reading through Sipser as part of a fundamentals of computer science course, and these examples really helped me get a grasp of converting from NFAs to DFAs. Appreciate it!
Trust me when I say that I don't even bother looking at other TH-cam channels when it comes to the Theory of Computation. The explanation is very clear here. I love it.
Epsilon (also commonly referred to as lambda) is NOT a symbol. It doesn't mean empty symbol. It's a string, and it is the reason why the set of symbols for a language will never include epsilon (a.k.a. lambda). Regardless, this is the best video for this topic.
yeah, epsilon is an empty string. But, I don't think its ever referred to as "lambda" too. Epsilon definitely is included in a language, as an example you can consider a language 'L' that accepts strings formed with an equal length of 0s and 1s from the alphabet {0,1}. One of the simplest possible stings you can form is: no string at all--Epsilon.
In this example, must make states A, B, C all initial states! the rules for that: pre = pre input, post = post input If q state includes a final state in its E*_pre then make q final. If an initial state exists in E*_pre of q state then make q initial.
are there like two methods? I saw one method in which there was one extra step of removing the edge and if the vertex1 is initial and vertex 2 is not then we make vertex 2 as initial. in that method the answer is different and I don't know why the answer is different
Can't we use only 1 arrow for transitions between 1 pair of states on both input? For ex: why don't use just one arrow for inputs 0 and 1 from A state to B state?
in the input output table(0,1), would you only include states that have epsilon? For example, if A did not have an epsilon and went on 1, would you include that in the table.
The best thing for the instructor to do would be to start from scratch with the rendering of this state machine and describe the various layers. Then provide the solution. He understands the syntax but we do not.
The problem with mathematicians is that they make godawful syntax and abstractions. This isn’t very ergonomic, human friendly, or clear. It’s quite cryptic in nature.
Can't the NFA finally obtained be minimized to just one accepting state with a self loop at any input? Since this one is also going to accept any input string to it due to all the states being accepting.
please, if i have 2 states q1 and q2,q2 is not final state, and there is epsilon transition between them and i have not another transition with q2 , what is the rule?
All you need to know is the notation and syntax. I see a, b, and c but do these circles definitively represent distinct states? Just depends on the grammar, etc: ahhh..::according to our instructor yes they do. Kewl!! Not as hard as it seems.
Thank you. I've learned a lot from you videos. The sound is clear, your accent is very understandable and the way you explain helps with writing apps that use the algorithms. Great job!
Your videos are the greatest series in Automata theory.
Nice explanation
international student sir scholarship dena isse
@@vijoyjyotineog1896 lol
Digital electronics was the best
Kewl
Just a quick thanks, I've been reading through Sipser as part of a fundamentals of computer science course, and these examples really helped me get a grasp of converting from NFAs to DFAs. Appreciate it!
Watching after 7 yrs
7 yrs 7 months
@@lowercaseguydev5333 7yrs 7 months 7 days
@@lowercaseguydev53337 yrs 7 months 2 weeks
exactly @@lowercaseguydev5333
@lowercaseguydev5333
7 and 8 months ;)))))))
Holy Moly! I was struggling for about half an hour on this, thanks man your method is absolute.
Style Queen Sera
Luv from INDIA
Rookie Number...strugging here for life.
Trust me when I say that I don't even bother looking at other TH-cam channels when it comes to the Theory of Computation. The explanation is very clear here. I love it.
Thank you! I specifically disabled my ad block so you can get revenue for helping me on autonoma
This method is amazing! Much better than our lecture told.
Epsilon (also commonly referred to as lambda) is NOT a symbol. It doesn't mean empty symbol. It's a string, and it is the reason why the set of symbols for a language will never include epsilon (a.k.a. lambda). Regardless, this is the best video for this topic.
yeah, epsilon is an empty string. But, I don't think its ever referred to as "lambda" too. Epsilon definitely is included in a language, as an example you can consider a language 'L' that accepts strings formed with an equal length of 0s and 1s from the alphabet {0,1}. One of the simplest possible stings you can form is: no string at all--Epsilon.
@@iflowlikewater Lambda being used instead of epsilon is not uncommon it isn't a matter of opinion.
@@Isaac-eh6uu Like that's literally the Greek alphabet Lambda
Always making great videos !! as a student I find these videos extremely helpful.
Watching it on the day of the exam. Thanks for the work.
THANK YOU VERY MUCH FOR THIS VIDEO. THIS LITERALLY HELP ME A LOT ON MY PAPER
Thanks a lot. I've learned a lot of things from you.
Another great lesson! Thank you for this!
Great teacher. my teacher plays your videos in lectures
Thank you very much! I understand much better, now!
Brilliant! Thank you
thank you . your explanation was precise and clean
Words can't describe the love I want to give to this man
watching it an hour before exam
Rest in peace my G🤍
Your video is solve every automata theory
wow
Thank you for your lectures and effort.
very well explained the concepts of epsilon NFA , thank you
Thank you so much Neso Academy
Everything is well understood.
😀❤️❤️❤️
very good explanation, helped a lot
Superb explanation sir. Thank you very much......
very nice and perfect explanation
so much better than my teacher's explanation
Thankkkk uuu .it's really helpful 🫰🏻🫰🏻
In this example, must make states A, B, C all initial states! the rules for that: pre = pre input, post = post input
If q state includes a final state in its E*_pre then make q final.
If an initial state exists in E*_pre of q state then make q initial.
there must be only one initial state
Thankyou... U explained really well 💜
This is so helpful, thank you for making this tutorial series!
Perfect explanation....tq so much sir......
Thank You so much💯💯
Thank you so much.This is very helpful for me.
Thank You♥
Your videos r really awesome
are there like two methods? I saw one method in which there was one extra step of removing the edge and if the vertex1 is initial and vertex 2 is not then we make vertex 2 as initial. in that method the answer is different
and I don't know why the answer is different
As of my knowledge B should also be initial state and edge A to B should be label as only 1 as I saw in other method
thanks a bunch, your videos helped me a lot
ALLAH BLESS you. What a great teaching skill you have.
tanks... you are the reason i can confidently study and get good grades...
thank you for this, i am now ready for my quiz sir!
Thank you so much Sir!
Nice Sir 😊
thanks, this is helpful
Thank you! Very clear!
Superb sir...
Big Fan Sir🤝✨👍👍
Thanks very much
Great explain
thank you so much!
Buen video te aventaste
It's so sad to check out that you haven't made any lectures on "Epsilon NFA to DFA" !!!
I think you can just do Epsilon NFA -> NFA -> DFA
Thanks for saving lives.
O thank you very much sir I am so afaired. Tomorrow my flat exam and I don't no anything tx sir you save me 😄
nice video brother
Amaaazing videos !!
Love it ❤
Examguard!!!
Thanks a ton sir!
Good job sir
B and C should also be marked as the initial state.
Pls explain this concept with other example that convert to dfa
it's easy once you get NFA you should converted from NFA to DAF
This was little bit hard to understand, but I understood it. Thank you
Why was the reason for this procedure you didn't tell why we have to follow e* input and e*
please video about E-NFA to DFA
Yes
Sir please make playlist on Advance computer Architecture
Thanks sir
Thanks!
Thank you .
Thankyou so much sir🙏. May I know your name...?
thank you sir
Thankyou
Can't we use only 1 arrow for transitions between 1 pair of states on both input? For ex: why don't use just one arrow for inputs 0 and 1 from A state to B state?
yes we can.
same question
saved my life!
Thnaks dude, solved my doubt
Please correct me if I am wrong. I think this NFA will be able to accept all strings over the alphabet a,b.
in the input output table(0,1), would you only include states that have epsilon? For example, if A did not have an epsilon and went on 1, would you include that in the table.
man you are the best
The best thing for the instructor to do would be to start from scratch with the rendering of this state machine and describe the various layers. Then provide the solution. He understands the syntax but we do not.
you are the only appearing GOD before the exams thanks a lot ❤🔥❤
Thank you very much sir.
If I didn't watched your video I would never understand it
gori kardi
should we put two different lines for 0 and 1,or just 0,1 in one line is okay,sir?
Why do you set the 3 states as accepting states? Shouldn't it be only C and A?
the answer is at 6:58 , this particular e-nfa accepts any word as it has e-transitions from initial state to an accepting state
So at the 2:25 mark it’s just a matrix.
A 3x2 one.
can we replace 2 line by one line for B to C on 1,0 9:16
Yes you can do it
oh goood thank you thank you
We need epsilon nfa to dfa as well please
The problem with mathematicians is that they make godawful syntax and abstractions. This isn’t very ergonomic, human friendly, or clear. It’s quite cryptic in nature.
I don't think that state B is final, only A and C are final. F union A, so C union A is A and C.
Can't the NFA finally obtained be minimized to just one accepting state with a self loop at any input? Since this one is also going to accept any input string to it due to all the states being accepting.
Kisses from greece!
Least useful channel our teacher does not uses you method
Sir I think here A doesn't have the e*closure with c
Thank you, very clear
please, if i have 2 states q1 and q2,q2 is not final state, and there is epsilon transition between them and i have not another transition with q2 , what is the rule?
THANK YOU VERY I LOVE IT
Egyptiaan Citizen
Love from INDIA
If all the states are final states then what is the use of having NFA, let the machine accepts all the inputs
this is just to show how the conversion is done in a common scenario
After conversion of the following epsilon NFA to NFA what is the number of input alphabets in the resultant NFA
Hey, what about the final states if there are no states which doesn't reach final states on seeing epsilon ?
make them initial in your nfa simple
All you need to know is the notation and syntax. I see a, b, and c but do these circles definitively represent distinct states? Just depends on the grammar, etc: ahhh..::according to our instructor yes they do. Kewl!! Not as hard as it seems.