I got 98/100 in toc( bca), thanks you and other yt channels for uploading videos.
@collegematerial53482 жыл бұрын
From where means which book you practice the question and please also tell which channel you follow Also tell for maths 4
@NathanLAlvares Жыл бұрын
Scholar mare
@daraniprasad74287 ай бұрын
Solllleyyy😂
@sahilgaonkar10993 жыл бұрын
Ma'am video was very helpful... But one point is "In DFA there should be a transition for EVERY input character" So You must have shown that using a dead/trap state
@vibhu6133 жыл бұрын
Yes... I think so
@rishmtechzz98903 жыл бұрын
Yaah we have to add Dead state when there is Phi in above DFA table
@rahem0272 жыл бұрын
If there is no transition, it is assumed the input is rejected there. There is no transition for every character in any FA afaik
@kainaatmakhani65502 жыл бұрын
You are saying right. In the "DFA" transition diagram dead state is missing.
@pritamdebnath33843 жыл бұрын
less than 6 hrs left for sem exam and I'm here watching this....lmao
@TheProblemSolvers383 жыл бұрын
Would be better if you watch it in the examination hall itself..............
@messiisthebest3 жыл бұрын
Same
@kartikbarmaiya56503 жыл бұрын
Less than half an hour left for mid sem exam and I'm watching this.
@nammkarnatakashootout37483 жыл бұрын
For me just 2hours remaining for exam
@sandeshrbhat243 жыл бұрын
Last 1 he
@abingeorge44492 жыл бұрын
Thanks a lot miss i have my FLAT exam in about 3 days and our teacher made this shit so much harder than it should be.
@ShubhVerse318 ай бұрын
I want to clear sem exam exam is starting by Tuesday please prayer for me i pass all subject😢😢😢
@mallikarjunavb-gi2hi8 ай бұрын
Me too bro...
@ShubhVerse318 ай бұрын
@@mallikarjunavb-gi2hi best of luck my good wishes with you
@wilxer58787 ай бұрын
U definitely fail good luck
@ShubhVerse317 ай бұрын
@@wilxer5878 why r uh telling like this ??
@PROGAMING-hf4ob11 ай бұрын
many explanations in the youtube where really complicated and hard to remember but the table method you introduced in this tutorial was damn easy and is easilty rememberedd thankyou for mam for making this so easy
@Sweety4050010 ай бұрын
Yes it's easy, but konni videos lo verela undhi ee mathod, ye method follow avvalo teliyatledu
@syed-muhammad-ali-raza3 жыл бұрын
5:22 state a value is only q0 kindly check
@omdeep41373 жыл бұрын
Thankyou mam, this video made me Confident for such numericals
@loonysimmo9586 Жыл бұрын
Thank you maam 💓 but what is that sound in 7:22 😅😅
@oppranto2 жыл бұрын
What will happen if i got two e-closure for One input like. For "a" i got q1,q2 e-closure. Then what will happen?
@wednesdayaddams7182 ай бұрын
She is not a robot to answer machine like questions ask politely
@ankkol20112 жыл бұрын
Thanks a lot for this clear explainations. I was really looking very badly for a suitable example for epsilon NFA to DFA conversion. And finally found it. 💖💖
@preethammm46606 ай бұрын
🎉 Ma'am this video is life saving before exam 😊
@e-k41104 жыл бұрын
what happens when we have more than one states inside the e-closure? for example, I gotta find the e-closure of {q0,q1}, should I take the union of e-closure of q0 and q1?
@anitar84834 жыл бұрын
Yes. eclosure(q0) U eclosure(q1)
@e-k41104 жыл бұрын
@@anitar8483 thanks a lot
@yushmmgamer68678 ай бұрын
Very honest and precise explanation, Thanks
@rjhgworrioar97532 жыл бұрын
Ended with easy one example not even entered intermediate problem also ,But any how you have explained well ,appreciated for that
@maanyamuthamma357710 ай бұрын
Ma'am you're truly a blessing
@Bhuvan-gj7pe Жыл бұрын
Thanks a lot mam, i have my exams in an hour will get 10marks because of you :)
@SnehaWickramarathneDissanayake Жыл бұрын
Very Good up to the point of NOT including the Dead State for the null transitions
@erfanpanahi78945 ай бұрын
Thank you so much, it was really great
@fahaankhan9983 Жыл бұрын
but in DFA we have make transition for every symbol on each state....
@Rahul-ki1bh10 ай бұрын
Thank you for giving such good explanation ❤ it really save my many hours ❤🎉
@bandarurohitha5722 ай бұрын
Best video for understanding this concept simply
@yashwanthbl89464 жыл бұрын
Thank you ma'am. Easy to understand!🙏
@fearlessff64532 жыл бұрын
ghantaa
@0pini0n219 ай бұрын
How can a dfa have no transition for some symbols ??
@blaze1173 жыл бұрын
This is fundamentally wrong. You are just converting e-NFA to NFA. in DFA each state must have transitions equal to the number of inputs. I got so confused just because of this video
@onsyedes2133 жыл бұрын
same question here !! if i"ll add dead states, will it be a DFA ¿¿
@ShivaramkarriАй бұрын
yes, there is no definition for the transition of state b on input of a, and transition of state c on input of a and b!?
@S-GauravGhanekar6 ай бұрын
i have a doubt if {q2 a}= null but in dfa we can give null right? then a should go on deadth state?
@archanans99208 ай бұрын
Tqsm for clear explanation ❤
@NameNotFound934 Жыл бұрын
Many people comment here to add "dead state". But dead/trap state is not mandatory to add for 'phi'.
@xipingpungi29363 ай бұрын
Less than 12 hours left and i am watching😅
@kalgikansara73694 жыл бұрын
Do I need to write formula explaination for all ...or tables are ok??
@jorelletuyor4 жыл бұрын
Thank you mam for making us understand more with this tutorial.Thank you and God bless you always.❤😇
@amoldangat0073 ай бұрын
mam DFA always consists one way for each input symbol from every state , then why you don't make path for another inputs like from {q1,q2} where is the transition for "a". Please explain is it you missed or it is not necessary . Although you explain very well thank you so much .
@shrinidhijag_films2 жыл бұрын
Thanks you ma'am this made my life peaceful 🥰
@swastik46852 жыл бұрын
Less than 2 hours for internal, and I'm watching this here
@bhanupratapshishodia30272 жыл бұрын
Thanks mam you are teaching awesom every student cal easily learn keet up mam
@CodewithAshwani2 жыл бұрын
Easy to understand with no doubts.thank you mam.
@i__sandesh3 ай бұрын
This is epsilon nfa to without epsilon nfa, but not a dfa, since all of the alphabets are not used in each states.
@madhumohanajv9942 Жыл бұрын
Very clear explanation ma'am,thanks a lot ♥️🙌
@redcodes235419 күн бұрын
Mam do we need to draw the transitions for ɸ also in DFA?
@sarthakn4398 Жыл бұрын
This helped me a lot ❤ Thank you
@Sharath-m8l6 күн бұрын
2 hours before sem exam watching this....🙃🫣
@statusgallery91266 күн бұрын
Same
@JohnSmith-xg5wh3 жыл бұрын
I believe for a DFA must have an exiting transition arrow for every symbol in its alphabet but good video
@ZeeshanKhan-zf9os3 жыл бұрын
Yes u r right bro
@ZeeshanKhan-zf9os3 жыл бұрын
We should take a dead state
@dhakshinyabg68742 жыл бұрын
Is it possible that a DFA contains only the final state
@shwetathakare15569 ай бұрын
Clearly understood the concept thank you ❤
@nathimarygrace29733 жыл бұрын
Mam I did the same problem by converting first epsilon nfa to nfa and then nfa to dfa....but I got different answer? Can you help me to solve this issue
@mahimarai61973 жыл бұрын
Is this also for conversion of €NFA to it's equivalent DFA? Ma'am
@av764752 жыл бұрын
this was great, saved me a lot of time, thank you
@divyeshkoli22398 ай бұрын
there"s a doubt a null move to itself is always present even if its not marked right then in E-nfa table you havent marked null move for q2
@charanchalamasetty94273 жыл бұрын
For Dfa all i/p should have one path know maam..here we dont have all i/p for all states.how can we call this as a DFA?
@UpYourHand5 ай бұрын
Guys please read the description ma'am has mentioned the dead state...🙂
@jigarmaheshvari83193 жыл бұрын
But ma'am what about A B C state these are consider as final state or not? Plz replay if anyone know ans And second in DFA every state should make transition for every imput symbol but here we have to show that transition to trap state or not?
@ensainlearner3 жыл бұрын
A,B,C are final states and it's not mandatory to add trap/dead states here. Personally I add trap states to get complete satisfaction 😁
@vibhu6133 жыл бұрын
@@ensainlearner it's not rule??
@AdityaSingh-zk3fe3 жыл бұрын
This is so helpful. Thank you ma'am
@BirdOnBlueSky Жыл бұрын
Thank you for your detailed explanation!
@QuantumGaming1492 жыл бұрын
For the last DFA diagram(taking a,b,c as states) you forgot to keep all states to final states in this nfa with epsilon to DFA conversion
@nagamani7644 Жыл бұрын
Construct NFA with E which accepts a language Consisting the strings of any numb of o's followed by any number of 1'sfollowed by any number 2's, Also convert into witn E hansition. Explain this pbm mam
@simonlorimer58223 жыл бұрын
Hi Anita, great view by the way What I do the union eg {q0,q3} (in my example) I cannot find an e-closure that matches this What can I do if this happens?
@anitar84833 жыл бұрын
Can you send the question (€- NFA)?
@Krishna-xz4zd3 жыл бұрын
Mam for final state in dfa ...we have to check closure of q0 in nfa epsilon.if final state q2 is present in closure of q0 then q0 also should be present in set of final states and then final state is {q0,q2}.Mam but you taken q2 only has a final state
@deviprasadgm Жыл бұрын
Excellent teaching....thank you mam
@snehaljadhav40803 ай бұрын
thank you mam, very easily explained
@ZynoxOfficial00711 ай бұрын
But dfa must use all the output(a,b,c) symbol,here B,C don't use all output symbol
@jacknicholas15642 жыл бұрын
Usumularsey in the background 🔥
@piotrlezanski5156 Жыл бұрын
What, in DFA it is impossible, that from one state, you don't know where to go after some symbol. For example in your last DFA, from state B you have to go somewhere after symbol a, if it is not included, it is not a DFA...
@virral-ness22802 жыл бұрын
Less than 1 hour left from exam, agar ye paper me aya to maja aayega pure marks ☺
@swordlion2942 жыл бұрын
The best explanation, period.
@Updeus2 жыл бұрын
you forgot the transitions to the dead state for the DFA
@akulavarshith637911 ай бұрын
Mam how to find the union i we have q1,q2
@sujithnarayan5335 Жыл бұрын
could you please teach in detail so that people can understand the calculations in dfa, i cant understand that. the q0 union pi, etc are unable understand.please teach properly
@okaudi2 жыл бұрын
I lost in the DFA first state {q0,q1,q2}a -> {q0,q1,q2}, Can anyone explain that why ?
@surya45754 ай бұрын
self looping
@relmimaryk.j.368 Жыл бұрын
So there is no need to mark phi as qtrap in dfa?
@xyz-qz2ob Жыл бұрын
There should be square brackets not curly braces in DFA table
@mayankpathak072 жыл бұрын
Less than 9 hours remaining for sessional exam and i am watching this
@santhisri91293 жыл бұрын
Mam if there is no input symbols then what were we do
@mrak12482 жыл бұрын
Mam is there possible 'pi' in DFA Why didn't use dead state
@prithvirajsainiranjan6240 Жыл бұрын
Guys in place of phi put (qt) and keep it as dead state
@Sinchan_kundu2 ай бұрын
thank you very much maam very helpful
@aayushbajpai37932 жыл бұрын
Less than 6 hrs left to declare my Sem result....and I'm watching this video...lmao
@vipinkadu239311 ай бұрын
Less than 1 hour remaining and i will watching video....moye moye😢
@suhaskubasad9141 Жыл бұрын
mam i think u have a converted epsilon NFA to NFA rather than DFA, but still it was helpful
@madasuumamahesh51162 жыл бұрын
SUPER EXPLANATION MAM TO UNDERSTAND😇
@varunjojare Жыл бұрын
thank you!! Finally understood
@abhivish2017 Жыл бұрын
Very well explained ma'am
@kprasanthkumar18153 жыл бұрын
Very Good Explanation Madam
@kalpeshm9852 Жыл бұрын
Thank you mam ☺️ clearly explained
@blakemosley47969 ай бұрын
isnt one of the rules for a dfa that each state must have a transition for every symbol? B has no transition for a. C has no transition for either a or b. This wouldn't be a DFA.
@mohammedzainkhazi76673 жыл бұрын
Undrstood Well but I'm having doubt...........what if there is string after (q2) at least it should go to dead state na
@shashidharnagaral1033 жыл бұрын
Yeah, in DFA we need to add new state, lets call it 'D' as dead state or trap state, in place of '∅'. So all the remaining transition for other state can be moved to state 'D'.
@tailung63342 жыл бұрын
mam null shouldnt be there for DFA trans table right ?? so we have to include a dead state instead of NULL ???
@togya4 Жыл бұрын
girl your are the best
@anuragprajapati37123 ай бұрын
the solution is wrong , the solution explained in this video is to convert from epsilon nfa to dfa !
@anuragprajapati37123 ай бұрын
epsilon nfa to nfa
@nithiyasris14854 жыл бұрын
Thank you mam... It's very understandable...
@Pikachu775042 жыл бұрын
Thnx a lot mam..it's really helpful
@amrutamitti25963 жыл бұрын
Thnx mam. It's very understandable
@Samaraa12223 ай бұрын
Where are the trap sttaes ma'am
@nithin1729s9 ай бұрын
but isnt that a NFA at the end ???
@baboucarrgibba9336 Жыл бұрын
great explanation
@ayyappareddy44613 жыл бұрын
Awesomeeee explaination madammm
@poorniman77262 жыл бұрын
Supr mam ....understood clearly.
@AfraimZahangir4 жыл бұрын
what about the fi???
@wednesdayaddams7182 ай бұрын
Thanks a lot mam it saved me
@damnengineering2611 күн бұрын
diagram does not have dead state
@prajakthapprabhu61032 жыл бұрын
Mam plz Focus the paper properly...it keeps getting blurry