ขนาดวิดีโอ: 1280 X 720853 X 480640 X 360
แสดงแผงควบคุมโปรแกรมเล่น
เล่นอัตโนมัติ
เล่นใหม่
thanks alotmost of the videos have only the easy problems i was searching for this one
clear and percise explanationthank you mam for this lectures'
clear kaha tha bhai lmao
Watching this before exam, Thank You Mam it was so easy
Thanks ma'am 😊 very well EXPLAINED
Camera focus is quite not interesting .
Same here
Knowledge gained from this was awesome so please shutup
Is it subset construction method? But in many other videos there is another method...?
It helped me a lot in exams, thank you ma'am : )
which clg are you from ?
Thanks mam very well explained
Thank u so much medam this video helps me lot ❤️
The Good Video Mam!
Thank you
Camera man is playing with focus point 🤣
BUT DFA SHOULD HAVE ONLY 1 INPUT RIGHT MAM ?
Nice explanation mam😊
very clear explaination mam very eas to understand tnx mam
tapai ko fan vale may dd!! love from Nashville
One mistake in q0,q1,q2,q3 on1 you just change the order so it makes the some wrong just check it again mam
Mam can we write epsilon state in dfa , while it is in nfa transistion
Unga video paakrathu onnutha paakathathu onnutha.camera focus super ah iruku ponga
😂😂😂😂
Tqs a lot
Thanks so so much!!!
thanks mam .... thanks for the explanation
Thank u so much mam 😍😍 your video helps me and my friends a lot
Its very help full
Thank you mam ☺️
DFA states are only enclosed square brackets not a curly brackets.
Thanks you , you really help us ,
Mam DFA transition table should represent using [ ] square brackets
well explained
How does this differ from lazy technique though
this is not as lazy as lazy technique
very nicely explaned thanks a lot
Thankyou mam
Nice explanation mam
From Nitte?
Mam in this example is use sub set method or not
Thank you so much but little error of camera just try to fix next time
Mam Camera very Bad quality 😡😡
U better gift her a iphone
increase brightness write it yourself
Mam but dfa means it should have single path but at last diagram 2 nodes have more than 1 path no?? Pls reply
mam give reply to his query?
No. In this DFA also all nodes have single edge for each input
Mam is it subset construction method?
i wish you the best
Thanks mam
mother flower ye mobile tora pechi kar
أسطورة
Mam how we know that the final states pls me. Tell me
didnt understan why it has two final state ??mam please explain
It's because q3 is in final state in your NFA so in dfa wherever it occurs it's a final state
No video clarityy
Why there is no null state?The previous example is having it
In this example, we have constructed DFA by considering only accessible states
Hellow you mean dead state
This is not Subset Construction
Tqq mam😇
Hi
focus your camera
Noott clear ,,,,,
Camera main focus karo
please turn off the auto focus in mobile camera. it is very annoying
The focus is really annoying me 😂
Camera was not at all good
SILKIKKI GAARUNN KARAXI
thanks alot
most of the videos have only the easy problems
i was searching for this one
clear and percise explanation
thank you mam for this lectures'
clear kaha tha bhai lmao
Watching this before exam, Thank You Mam it was so easy
Thanks ma'am 😊 very well EXPLAINED
Camera focus is quite not interesting .
Same here
Knowledge gained from this was awesome so please shutup
Is it subset construction method? But in many other videos there is another method...?
It helped me a lot in exams, thank you ma'am : )
which clg are you from ?
Thanks mam very well explained
Thank u so much medam this video helps me lot ❤️
The Good Video Mam!
Thank you
Camera man is playing with focus point 🤣
BUT DFA SHOULD HAVE ONLY 1 INPUT RIGHT MAM ?
Nice explanation mam😊
very clear explaination mam
very eas to understand
tnx mam
tapai ko fan vale may dd!! love from Nashville
One mistake in q0,q1,q2,q3 on1 you just change the order so it makes the some wrong just check it again mam
Mam can we write epsilon state in dfa , while it is in nfa transistion
Unga video paakrathu onnutha paakathathu onnutha.camera focus super ah iruku ponga
😂😂😂😂
Tqs a lot
Thanks so so much!!!
thanks mam .... thanks for the explanation
Thank u so much mam 😍😍 your video helps me and my friends a lot
Its very help full
Thank you mam ☺️
DFA states are only enclosed square brackets not a curly brackets.
Thanks you , you really help us ,
Mam DFA transition table should represent using [ ] square brackets
well explained
How does this differ from lazy technique though
this is not as lazy as lazy technique
very nicely explaned thanks a lot
Thankyou mam
Nice explanation mam
From Nitte?
Mam in this example is use sub set method or not
Thank you so much but little error of camera just try to fix next time
Mam Camera very Bad quality 😡😡
U better gift her a iphone
increase brightness write it yourself
Mam but dfa means it should have single path but at last diagram 2 nodes have more than 1 path no?? Pls reply
mam give reply to his query?
No. In this DFA also all nodes have single edge for each input
Mam is it subset construction method?
i wish you the best
Thanks mam
mother flower ye mobile tora pechi kar
أسطورة
Mam how we know that the final states pls me. Tell me
didnt understan why it has two final state ??
mam please explain
It's because q3 is in final state in your NFA so in dfa wherever it occurs it's a final state
No video clarityy
Why there is no null state?
The previous example is having it
In this example, we have constructed DFA by considering only accessible states
Hellow you mean dead state
This is not Subset Construction
Tqq mam😇
Hi
focus your camera
Noott clear ,,,,,
Camera main focus karo
please turn off the auto focus in mobile camera. it is very annoying
The focus is really annoying me 😂
Camera was not at all good
SILKIKKI GAARUNN KARAXI
Thank you