Conversion of NFA to Regex PROOF (GNFA Method)

[@haydentaylor9857]

I missed my class, forgot a mask😩, but your video helped me so much to be able to learn what I missed!

[@vimalathithand917]

We can make a new single final state and make an epsilon transition from all previous final states and we can make the previous final states to normal states. For the infinitely many regex can be constructed for a regular language because we can concatenate any number of epsilon to an existing regex,either at the begining ,middle or end. Hope this helps

[@salonisharma]

Amazing video for me.... U explained everything very nicely... Thank you soo much for this. Really very nice 👏👏

[@aria1720]

You helped me a lot. Amazing thank you so much!

[@hardworkleaner]

amazing videos for me

[@vimalathithand917]

A wonderful video!!

[@supamdeepbains5172]

Every NFA can have one final state if we make the existing final states as nonaccepting final states and insert epsilon transition from those states to the only created final state. Hance Phrooofed

[@m7mdxxd11ab]

bro i love you

[@samjudelson]

Thanks!

[@GavinFreeborn]

Hey I likey your videos! Any chance you could do a Video on converting a PDA to a contract free grammer?

[@EasyTheory]

Not sure if there is such a thing as a contract free grammar ;) and yes I will eventually.

[@GavinFreeborn]

@@EasyTheory hahaI meant context didn't read that over.

[@wincash584]

Watching 3rd time in single shot

[@priyamvashi2187]

i think by epsilon transition we can make only one final state in nfa

[@rahulambastha8b472]

please use gate keyword in your video title as many of us get passed seeing a foreign prof teaching, we assume the course not to be suitable of our gate level exam. Using gate keyword would help to get better reach .

[@kiarashhajian8181]

awli