conversion of NFA to DFA example | Part-2 | TOC | Lec-20 | Bhanu Priya

conversion of nfa to dfa example

[@alphapesiesongs7102]

I found other tutorials confusing but you Bhanu Priya, actually managed to teach me that. I'm grateful.

[@jamesfleming4919]

Thanks a lot. I was making this more confusing than it needed to be. Thanks for the straightforward method!

[@nickbaib1839]

Good job! Thank you so much for your lessons! You uploaded thm at the right time. I give exams in September, and I have the best notes to read! Respect from Greece!

[@ItsMeMayur007]

Tumhri comment ko 3 year ho gaye he tume sayd yaad nhi hoga Kya tume 3 saal baad koi acchi job mili he 😂

[@Av_69_]

@@ItsMeMayur007 aur tumko 4monthsss

[@sehbanfarooq6120]

@@ItsMeMayur007 brooo🤣🤣🤣

[@shwetapakhale2231]

But in dfa We can transition only one input at a time But in state [q0,q1,q3] they go 2 output at one transition

[@thugxrahul]

And in the state [q0 q1 q2 q3] also ...

[@suvamlive4629]

Didi best hai♥️🔥 Respect from somewhere in India

[@adarshrajsatyam2007]

Here is a doubt ma'am.. u have said before that DFA has only one path for specific input from the current state to next state...but here for last two state there are more than one path for next state.

[@henish98]

The concept is that there should be only one output for each input. But there can be two inputs for a single output.

[@statuscorner1809]

Its a doubt for me too🤔

[@dhyaneshwaribhende2628]

Mam you said that the difference between nfa and dfa is that nfa state contain multiple path and dfa contain single path.... But in this example after the conversion of nfa to dfa the dfa is also containing multiple path.. like. a, b .... So mam is this conversion is correct?????

[@Pavithra.06]

Dfa cannot contain multiple path for a single input...like it contain 2 paths one for a and one for b...but it cannot have 2 paths for a while nfa can have multiple inputs for a single path that's the difference

[@ailachanakyadarahas6156]

@@Pavithra.06 but in 8:58 minutes ,there is multiple path from (q0 q1 q3 )to (q0 q1 q2) I.e(a,b)

[@mohitzen]

@@ailachanakyadarahas6156 multiple paths of SAME SYMBOL cannot be there. See there're two paths but for a and b separately. Not both are for a.

[@umairbhai4257]

​@@mohitzenyar Kya a and b separately ja sakta tha next state per

[@mohitzen]

@@umairbhai4257 yes

[@mohitzen]

Very nicely explained. U r a Life saver. Tomo is mah exam. Today is 11 dec 22.

[@Vladivostok29]

did you do good motha fucca? im wishing you well

[@theprofessorsergio]

😂​@@Vladivostok29

[@aravindnaik1414]

Very much cleared about these topics. Tq soo much for helping during my ecam time mamm😍😍

[@cp_200]

Nahi degi

[@ayushrameja]

@@cp_200 lol

[@mumairalim8505]

mam you are so good i love the method you teach love from pakistan

[@pravalikaanimoni8372]

Good explanation mam

[@harshasuryaabhishekkota3048]

thank you mam for the series.

[@UdayKiranAkula]

Thank You MAM❤❤

[@kalindhunavanjana4803]

what happen if there is still a state which don't have a transition for an input in DFA. Do we need to keep it not derected or make a loop to the same state?

[@shashankh3]

last two transition states in dfa table have same transition states for a, as well as b.

[@rahulsingh4307]

mine doubt tooo

[@mohitvishal9685]

Bro resulting Transition states can be the same..input set must not repeat🤙

[@नेपालीmusicindustry]

Same doubt

[@bismashaikh7979]

Thank youu so much mam.. It was very helpful 😇

[@SafiKhanCreation]

Nicely explained ❤

[@soujanyasamudrala5393]

Mam my doubt is in dfa possible passing only one input and not possible to passing two inputs

[@ailachanakyadarahas6156]

Yeah Same doubt

[@sushantanand4609]

mam why q0q1q3q2 not taken as a new state

[@mansisharma711]

this was so helpful thanks :)

[@VibinwithVMR9]

Thank you very much Mam 👍

[@NAJUSHORT]

Thank you

[@ayeshapatel5305]

Thanks ❤❤

[@Rainbow-jv6jo]

Thank you Mam👍..

[@Gandhiboy]

Thank you so much

[@prakashelumalai710]

Thanksgiving 🙏

[@GSurendraKumarCSE]

mam, in this NFA transition table two more combinations is there ,like ( q0 q1) 0r ( q0 q2), so how to create DFA transition tatble

[@hemanthgowda2517]

thank you mam

[@shad491]

very well

[@deepthichelluboina346]

If we get 2 new states then what will we take for next operation mam?

[@adityacomic]

Thank you ma'am

[@harshinigautam4305]

You did not write states for [q0q1q3q2] in dfa transition table!!

[@abhishekchaware9318]

Mam we can Phi na but after which one 4 State or before 4 state

[@QualityEducationForU]

Mam {q0,q1,q3,q2} Is New State why not taken as an independent state Like Other New States? I am a little bit confused on that. Please replay me Mam

[@NaeemAbbas-uz2ru]

Oh fool

[@yesuraju-tf1yp]

thanks akka

[@srimarp5094]

Plz solve convert enfa to nfa

[@krishnavamsi9811]

tnq u so much

[@yogendradahal315]

at last the state diagram went to nfa only .

[@ailachanakyadarahas6156]

Yeah bro

[@novicecoder5753]

Mam the answer also in NFA but we have to convert it into DFA am I correct

[@shaikabdulmohammed2993]

It's is carrying a,b how will it be dfa .u only said right dfa carries only one input

[@ailachanakyadarahas6156]

Yeah bro.. it's mistake I think

[@manikyamthulasipriya6859]

Mam u take first diagram of nfa to transaction table If first take direct transaction table how to that process

[@sanjanas9338]

Maam what to do when there is ε??

[@doreenantwi5118]

Nice

[@power3893]

Mam what is final state in dfa diagram,mamm how many states construct in dfa

[@Youtuber-xq6fx]

It is good but take simple examples mam It is very complicated

[@Cricket_kings245]

For DFA final state should be only one

[@VishalKumar-yj3li]

ma'am, how from {q0q1q3}, a,b is passed to {q0q1q2} ? is it possible in dfa ? please reply

[@mayankbhargava-cse9778]

Same how is this possible ? If yes.. then, Is this still dfa.

[@ailachanakyadarahas6156]

Yeah bro . Same doubt

[@kkumarsumit5346]

Gud

[@vijaygulla3854]

Ma'am what to do if we get 2 new states??

[@ritikaluthra5161]

Koi btaega tha madam ne 2 final states ku li

[@manaspalai8704]

How can i know which are final states

[@prayasparasar9277]

may be your last trasiction state can be wrong as per your tutorial

[@GSurendraKumarCSE]

u are saying using only one combination ,ex ( q0 q1).....plz give some clarity

[@balamurali1174]

Its useless ..there r 2 states..having more paths?

[@shivakumaran1285]

Why shd we take q0 q1 as new state

[@subhajitghosh3867]

Atlast the ans is also nfa coz a, b passes in one line.

[@nailagulzar1464]

bro it is dfa, the dfa will read either a or b. a,b can pass through one state.

[@subhajitghosh3867]

@@nailagulzar1464 in one line is it possible in dfa?

[@nailagulzar1464]

@@subhajitghosh3867 yes because alphabet set contains a and b, so every state of dfa must have 2 outgoing transitions a and b. As so the last state has a,b.

[@juvelandawawithfun2106]

Ma'am i think some mistake there in this example

[@prakashkammam81]

In DFA there is no multiple paths but in this example it's wrong i think

[@ailachanakyadarahas6156]

Yeah bro. Same doubt

[@milind1356]

mam doubt??

[@pasinduudara7212]

q0q1q3q2 is a new state. You didn't get it. So this is an uncompleted answer

[@harshavardhan5368]

Ur diagram is wrong madam

[@SREERAMSAIKUMAR]

Why only *[Q0 Q1 Q2 Q3]* as next state????? Why not *[Q0 Q1 Q3]* ?????

[@harshanchinthala5618]

[Q0 Q1 Q3] is already in existence in previous state

[@LakhanSingh09]

maam rehne do nahi padhana aara to koi zabardasti nhi but galat mat padhaoo

[@jathinbada3841]

Madam show your face mam

[@dilara4816]

Thank you

[@pathivadarajesh950]

thank you so much mam

[@keshavarm6749]

Thank u