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!
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?????
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
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.
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?
@@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.
I found other tutorials confusing but you Bhanu Priya, actually managed to teach me that. I'm grateful.
Thanks a lot. I was making this more confusing than it needed to be. Thanks for the straightforward method!
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!
Tumhri comment ko 3 year ho gaye he tume sayd yaad nhi hoga
Kya tume 3 saal baad koi acchi job mili he 😂
@@ItsMeMayur007 aur tumko 4monthsss
@@ItsMeMayur007 brooo🤣🤣🤣
The Best>>>>🛐
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
And in the state [q0 q1 q2 q3] also ...
in dfa one input go to one state only...hence a from [q0,q1,q3] go to [qo,q1,q2] like wise input of b also to one state only that is [q0,q1,q2]
Didi best hai♥️🔥 Respect from somewhere in India
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?????
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
@@Pavithra.06 but in 8:58 minutes ,there is multiple path from (q0 q1 q3 )to (q0 q1 q2) I.e(a,b)
@@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.
@@mohitzenyar Kya a and b separately ja sakta tha next state per
@@umairbhai4257 yes
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.
The concept is that there should be only one output for each input. But there can be two inputs for a single output.
Its a doubt for me too🤔
mam you are so good i love the method you teach love from pakistan
Very nicely explained. U r a Life saver. Tomo is mah exam.
Today is 11 dec 22.
did you do good motha fucca? im wishing you well
😂@@Vladivostok29
Good explanation mam
mam why q0q1q3q2 not taken as a new state
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?
Very much cleared about these topics. Tq soo much for helping during my ecam time mamm😍😍
Nahi degi
@@cp_200 lol
If we get 2 new states then what will we take for next operation mam?
Mam my doubt is in dfa possible passing only one input and not possible to passing two inputs
Yeah
Same doubt
Thank You MAM❤❤
thank you mam for the series.
Mam we can Phi na but after which one 4 State or before 4 state
Thanks ❤❤
last two transition states in dfa table have same transition states for a, as well as b.
mine doubt tooo
Bro resulting Transition states can be the same..input set must not repeat🤙
Same doubt
Thank youu so much mam.. It was very helpful 😇
You did not write states for [q0q1q3q2] in dfa transition table!!
Thanksgiving 🙏
Nicely explained ❤
Mam the answer also in NFA but we have to convert it into DFA am I correct
this was so helpful thanks :)
Thank you Mam👍..
very well
Mam what is final state in dfa diagram,mamm how many states construct in dfa
mam, in this NFA transition table two more combinations is there ,like ( q0 q1) 0r ( q0 q2), so how to create DFA transition tatble
Mam u take first diagram of nfa to transaction table
If first take direct transaction table how to that process
Thank you very much Mam 👍
Maam what to do when there is ε??
Ma'am what to do if we get 2 new states??
this is a very simple question ... shouldhave solved a more complex one for us to understand more complex questions too
thank you mam
Koi btaega tha madam ne 2 final states ku li
Thank you ma'am
thank you so much mam
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
Oh fool
How can i know which are final states
It's is carrying a,b how will it be dfa .u only said right dfa carries only one input
Yeah bro.. it's mistake I think
thanks akka
Thank u
ma'am, how from {q0q1q3}, a,b is passed to {q0q1q2} ? is it possible in dfa ? please reply
Same how is this possible ?
If yes.. then, Is this still dfa.
Yeah bro . Same doubt
Why shd we take q0 q1 as new state
Nice
tnq u so much
Ma'am i think some mistake there in this example
Gud
Its useless ..there r 2 states..having more paths?
Plz solve convert enfa to nfa
q0q1q3q2 is a new state. You didn't get it. So this is an uncompleted answer
u are saying using only one combination ,ex ( q0 q1).....plz give some clarity
at last the state diagram went to nfa only .
Yeah bro
mam doubt??
It is good but take simple examples mam
It is very complicated
For DFA final state should be only one
may be your last trasiction state can be wrong as per your tutorial
Atlast the ans is also nfa coz a, b passes in one line.
bro it is dfa, the dfa will read either a or b. a,b can pass through one state.
@@nailagulzar1464 in one line is it possible in dfa?
@@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.
In DFA there is no multiple paths but in this example it's wrong i think
Yeah bro. Same doubt
Why only *[Q0 Q1 Q2 Q3]* as next state?????
Why not *[Q0 Q1 Q3]* ?????
[Q0 Q1 Q3] is already in existence in previous state
Ur diagram is wrong madam
maam rehne do nahi padhana aara to koi zabardasti nhi but galat mat padhaoo
Nacha kara patha au padhaoni
Madam show your face mam
Thank you so much
Thank you
Thank you