Conversion of Epsilon NFA to NFA

[@ProfessionalTycoons]

Your videos are the greatest series in Automata theory.

[@dspatnaik1]

Nice explanation

[@vijoyjyotineog1896]

international student sir scholarship dena isse

[@vikrambhavsar3558]

@@vijoyjyotineog1896 lol

[@actionplay1018]

Digital electronics was the best

[@antwanwimberly1729]

Kewl

[@anikethjana416]

Watching after 7 yrs

[@lowercaseguydev5333]

7 yrs 7 months

[@morwanisujal7698]

​​​@@lowercaseguydev5333 7yrs 7 months 7 days

[@barbod2380]

@@lowercaseguydev53337 yrs 7 months 2 weeks

[@raiba3041]

exactly ​@@lowercaseguydev5333

[@HopeNHopes]

​@lowercaseguydev5333 7 and 8 months ;)))))))

[@vampirinhopsl]

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!

[@WaiSanLee]

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!

[@hotaru6765]

Holy Moly! I was struggling for about half an hour on this, thanks man your method is absolute.

[@rahultech2177]

Style Queen Sera Luv from INDIA

[@vishalcseiitghy]

Rookie Number...strugging here for life.

[@OwzaB]

Trust me when I say that I don't even bother looking at other KZbin channels when it comes to the Theory of Computation. The explanation is very clear here. I love it.

[@hectorg362]

Thank you! I specifically disabled my ad block so you can get revenue for helping me on autonoma

[@scottzeta3067]

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

[@hebaaburabia3056]

Always making great videos !! as a student I find these videos extremely helpful.

[@fupopanda]

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.

[@iflowlikewater]

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.

[@Isaac-eh6uu]

@@iflowlikewater Lambda being used instead of epsilon is not uncommon it isn't a matter of opinion.

[@pemifo260]

@@Isaac-eh6uu Like that's literally the Greek alphabet Lambda

[@KuriakoseKuruvilaAnathanam]

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

[@aita7102]

THANK YOU VERY MUCH FOR THIS VIDEO. THIS LITERALLY HELP ME A LOT ON MY PAPER

[@juanreina96]

Words can't describe the love I want to give to this man

[@shinigamiryuk4183]

Great teacher. my teacher plays your videos in lectures

[@kaywilfert8297]

Another great lesson! Thank you for this!

[@ozbayhilmi]

Thanks a lot. I've learned a lot of things from you.

[@shashankpandey7273]

watching it an hour before exam

[@somajeetpathak6389]

Rest in peace my G🤍

[@gadesasani7077]

Your video is solve every automata theory

[@Arjun8BPCracker]

wow

[@poornisha9688]

thank you . your explanation was precise and clean

[@amishachourpagar9925]

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

[@brianmagana4478]

Thank you very much! I understand much better, now!

[@leeamraa]

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.

[@yusufsenyuz]

there must be only one initial state

[@Mark-xc4tq]

very good explanation, helped a lot

[@dr.manisharajendradhage9734]

very well explained the concepts of epsilon NFA , thank you

[@siddharthmishra1061]

Thank you for your lectures and effort.

[@andrewsavastysnov6891]

so much better than my teacher's explanation

[@aesophor]

This is so helpful, thank you for making this tutorial series!

[@_krishna.words_]

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

[@shubhamtripathi2270]

very nice and perfect explanation

[@samlopezruiz]

Brilliant! Thank you

[@yashsaxena7787]

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

[@Sagar-zc3sr]

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

[@moonthoughts8822]

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

[@_randomyoutubeuser]

tanks... you are the reason i can confidently study and get good grades...

[@shatharashiramya5363]

Perfect explanation....tq so much sir......

[@acitajorellmcraileya.7101]

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

[@arzoojain4941]

Thankyou... U explained really well 💜

[@mounikas9608]

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

[@vishakha961]

Thankkkk uuu .it's really helpful 🫰🏻🫰🏻

[@muhammadakbarhadiq8127]

thanks a bunch, your videos helped me a lot

[@radhaharini5758]

Your videos r really awesome

[@shayanshaikh4167]

Big Fan Sir🤝✨👍👍

[@kinjalchaudhari4130]

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 😄

[@teekien98]

Thanks for saving lives.

[@laxmiwodeyar3113]

Pls explain this concept with other example that convert to dfa

[@zuhirbadr4864]

it's easy once you get NFA you should converted from NFA to DAF

[@MadduriGanesh29]

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?

[@imranmohammad1422]

yes we can.

[@junedmohammad7821]

same question

[@adamjahani4494]

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.

[@gladyouseen8160]

Why was the reason for this procedure you didn't tell why we have to follow e* input and e*

[@spidercoder7186]

Thank you so much Sir!

[@AadeshingaleOfficial-zl5fd]

Nice Sir 😊

[@moonedCake]

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

[@rakha8198]

I think you can just do Epsilon NFA -> NFA -> DFA

[@vinayaksharma-ys3ip]

Thank You so much💯💯

[@gadhamshettyyamini8314]

Superb sir...

[@omkarsuralkar8099]

Thank You♥

[@JeetuGuptaa]

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

[@Ramu9119]

nice video brother

[@angelixuscraft]

Why do you set the 3 states as accepting states? Shouldn't it be only C and A?

[@T3hIluvatar]

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

[@jethalalnhk2409]

This was little bit hard to understand, but I understood it. Thank you

[@litangrui4134]

Thank you! Very clear!

[@tomdapchai]

thanks, this is helpful

[@ayubalwahid5354]

man you are the best

[@rahulsaini15]

Amaaazing videos !!

[@analysisunplugged]

Sir please make playlist on Advance computer Architecture

[@howtoinform]

please video about E-NFA to DFA

[@helloitsme832]

Yes

[@rengarajansrinivasan4356]

Examguard!!! Thanks a ton sir!

[@antwanwimberly1729]

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.

[@slmanhm6339]

Great explain

[@nityunjgoel1438]

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.

[@vamckrishna2827]

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

[@manoharmaddula3802]

Thanks very much

[@Jess__333]

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

[@mobileuser1124]

Good job sir

[@lucasdasilvalima9598]

saved my life!

[@Rishank3003]

Least useful channel our teacher does not uses you method

[@ssjtso]

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

[@antwanwimberly1729]

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.

[@VishalSingh-on4ii]

Thnaks dude, solved my doubt

[@ManideepGoudDammagouni]

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

[@mikelogovi2252]

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?

[@chemselassil742]

thank you so much!

[@antwanwimberly1729]

So at the 2:25 mark it’s just a matrix. A 3x2 one.

[@badman4234]

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.

[@aktsyyyyy]

can we replace 2 line by one line for B to C on 1,0 9:16

[@priyank70763]

Yes you can do it

[@sivajisurisetty3604]

sir can u tell me the cnversion of epslion nfa to dfa

[@self-reliant9727]

first convert to nfa then convert to nfa to dfa...

[@ccuuttww]

right

[@uzairakram899]

create a transition table, write all the transitions, you will get sets of states for each transition, make these sets a new state define the transitions for these states, repeat the process till there are no new states and all transitions are defined. Use the table to construct a DFA.

[@vishaltrivedi540]

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

[@shashidharb96]

If all the states are final states then what is the use of having NFA, let the machine accepts all the inputs

[@T3hIluvatar]

this is just to show how the conversion is done in a common scenario

[@juanmedina-bocoslorenzo6809]

Buen video te aventaste

[@rupeshpabba5874]

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

[@mohammadzaid9189]

make them initial in your nfa simple

[@preethyfh3698]

Thankyou so much sir🙏. May I know your name...?

[@heideralali2197]

Thank you very much sir. If I didn't watched your video I would never understand it

[@yassir007fury]

gori kardi

[@Virajpatil32]

We need epsilon nfa to dfa as well please

[@haniaismail454]

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

[@talkingcomrade]

Love it ❤

[@jannatulnayeem433]

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

[@Visinasanscrit]

Kisses from greece!

[@dev_good]

Can anyone tell me why e closures of A is all A, B and C . It should be only A and B

[@adityak935]

A on epsilon goes to B, and B on epsilon goes to C , so A goes to C on epsilon (Zero input)

[@antwanwimberly1729]

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.

[@nulakachandanampraneeth]

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

[@sayantaniguha8519]

What about dead states ?

[@tipusingh1260]

Thank you .

[@veenadas4847]

thank you sir