Conversion of Epsilon NFA to NFA

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.

Sir I think here A doesn't have the e*closure with c

if i converted it to dfa what will be the accept state based on

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 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.

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.

should we put two different lines for 0 and 1,or just 0,1 in one line is okay,sir?

We need epsilon nfa to dfa as well please

Thanks a lot

its a little confusing for me :(

thanks, this is helpful

very nice and perfect explanation

B and C should also be marked as the initial state.

you are the only appearing GOD before the exams thanks a lot ❤‍🔥❤

nice video brother

Thank you for your lectures and effort.

Superb explanation sir. Thank you very much......

Examguard!!!
Thanks a ton sir!

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 😄

Εισα λεβεντης!!!Living Legend

ALLAH BLESS you. What a great teaching skill you have.

Watching it on the day of the exam. Thanks for the work.

Thank You♥

This method is amazing! Much better than our lecture told.

After conversion of the following epsilon NFA to NFA what is the number of input alphabets in the resultant NFA

can u tell me the reference book of this method??

Hey, what about the final states if there are no states which doesn't reach final states on seeing epsilon ?

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!

Thank you so much Sir!

Sir please make playlist on Advance computer Architecture

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.

Another great lesson! Thank you for this!

very well explained the concepts of epsilon NFA , thank you

thank you for this, i am now ready for my quiz sir!

Thanks very much

What about dead states ?

oh goood thank you thank you

watch at 1.5x if you are in hurry

Thank you! Very clear!

Great teacher. my teacher plays your videos in lectures

Please correct me if I am wrong. I think this NFA will be able to accept all strings over the alphabet a,b.

It's so sad to check out that you haven't made any lectures on "Epsilon NFA to DFA" !!!

Thankyou... U explained really well 💜

Thank You so much💯💯

Thank you so much Neso Academy
Everything is well understood.
😀❤️❤️❤️

Does number of states decrease when we convert epsilon nfa to nfa?

Thank you so much.This is very helpful for me.