Theory of Computation: Conversion of Epsilon-NFA to DFA

  Рет қаралды 526,125

Anita R

Anita R

Күн бұрын

Пікірлер: 278
@rosefilmcreation5948
@rosefilmcreation5948 2 жыл бұрын
I got 98/100 in toc( bca), thanks you and other yt channels for uploading videos.
@collegematerial5348
@collegematerial5348 2 жыл бұрын
From where means which book you practice the question and please also tell which channel you follow Also tell for maths 4
@NathanLAlvares
@NathanLAlvares Жыл бұрын
Scholar mare
@daraniprasad7428
@daraniprasad7428 7 ай бұрын
Solllleyyy😂
@sahilgaonkar1099
@sahilgaonkar1099 3 жыл бұрын
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
@vibhu613
@vibhu613 3 жыл бұрын
Yes... I think so
@rishmtechzz9890
@rishmtechzz9890 3 жыл бұрын
Yaah we have to add Dead state when there is Phi in above DFA table
@rahem027
@rahem027 2 жыл бұрын
If there is no transition, it is assumed the input is rejected there. There is no transition for every character in any FA afaik
@kainaatmakhani6550
@kainaatmakhani6550 2 жыл бұрын
You are saying right. In the "DFA" transition diagram dead state is missing.
@pritamdebnath3384
@pritamdebnath3384 3 жыл бұрын
less than 6 hrs left for sem exam and I'm here watching this....lmao
@TheProblemSolvers38
@TheProblemSolvers38 3 жыл бұрын
Would be better if you watch it in the examination hall itself..............
@messiisthebest
@messiisthebest 3 жыл бұрын
Same
@kartikbarmaiya5650
@kartikbarmaiya5650 3 жыл бұрын
Less than half an hour left for mid sem exam and I'm watching this.
@nammkarnatakashootout3748
@nammkarnatakashootout3748 3 жыл бұрын
For me just 2hours remaining for exam
@sandeshrbhat24
@sandeshrbhat24 3 жыл бұрын
Last 1 he
@abingeorge4449
@abingeorge4449 2 жыл бұрын
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.
@ShubhVerse31
@ShubhVerse31 8 ай бұрын
I want to clear sem exam exam is starting by Tuesday please prayer for me i pass all subject😢😢😢
@mallikarjunavb-gi2hi
@mallikarjunavb-gi2hi 8 ай бұрын
Me too bro...
@ShubhVerse31
@ShubhVerse31 8 ай бұрын
@@mallikarjunavb-gi2hi best of luck my good wishes with you
@wilxer5878
@wilxer5878 7 ай бұрын
U definitely fail good luck
@ShubhVerse31
@ShubhVerse31 7 ай бұрын
@@wilxer5878 why r uh telling like this ??
@PROGAMING-hf4ob
@PROGAMING-hf4ob 11 ай бұрын
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
@Sweety40500
@Sweety40500 10 ай бұрын
Yes it's easy, but konni videos lo verela undhi ee mathod, ye method follow avvalo teliyatledu
@syed-muhammad-ali-raza
@syed-muhammad-ali-raza 3 жыл бұрын
5:22 state a value is only q0 kindly check
@omdeep4137
@omdeep4137 3 жыл бұрын
Thankyou mam, this video made me Confident for such numericals
@loonysimmo9586
@loonysimmo9586 Жыл бұрын
Thank you maam 💓 but what is that sound in 7:22 😅😅
@oppranto
@oppranto 2 жыл бұрын
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?
@wednesdayaddams718
@wednesdayaddams718 2 ай бұрын
She is not a robot to answer machine like questions ask politely
@ankkol2011
@ankkol2011 2 жыл бұрын
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. 💖💖
@preethammm4660
@preethammm4660 6 ай бұрын
🎉 Ma'am this video is life saving before exam 😊
@e-k4110
@e-k4110 4 жыл бұрын
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?
@anitar8483
@anitar8483 4 жыл бұрын
Yes. eclosure(q0) U eclosure(q1)
@e-k4110
@e-k4110 4 жыл бұрын
@@anitar8483 thanks a lot
@yushmmgamer6867
@yushmmgamer6867 8 ай бұрын
Very honest and precise explanation, Thanks
@rjhgworrioar9753
@rjhgworrioar9753 2 жыл бұрын
Ended with easy one example not even entered intermediate problem also ,But any how you have explained well ,appreciated for that
@maanyamuthamma3577
@maanyamuthamma3577 10 ай бұрын
Ma'am you're truly a blessing
@Bhuvan-gj7pe
@Bhuvan-gj7pe Жыл бұрын
Thanks a lot mam, i have my exams in an hour will get 10marks because of you :)
@SnehaWickramarathneDissanayake
@SnehaWickramarathneDissanayake Жыл бұрын
Very Good up to the point of NOT including the Dead State for the null transitions
@erfanpanahi7894
@erfanpanahi7894 5 ай бұрын
Thank you so much, it was really great
@fahaankhan9983
@fahaankhan9983 Жыл бұрын
but in DFA we have make transition for every symbol on each state....
@Rahul-ki1bh
@Rahul-ki1bh 10 ай бұрын
Thank you for giving such good explanation ❤ it really save my many hours ❤🎉
@bandarurohitha572
@bandarurohitha572 2 ай бұрын
Best video for understanding this concept simply
@yashwanthbl8946
@yashwanthbl8946 4 жыл бұрын
Thank you ma'am. Easy to understand!🙏
@fearlessff6453
@fearlessff6453 2 жыл бұрын
ghantaa
@0pini0n21
@0pini0n21 9 ай бұрын
How can a dfa have no transition for some symbols ??
@blaze117
@blaze117 3 жыл бұрын
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
@onsyedes213
@onsyedes213 3 жыл бұрын
same question here !! if i"ll add dead states, will it be a DFA ¿¿
@Shivaramkarri
@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-GauravGhanekar
@S-GauravGhanekar 6 ай бұрын
i have a doubt if {q2 a}= null but in dfa we can give null right? then a should go on deadth state?
@archanans9920
@archanans9920 8 ай бұрын
Tqsm for clear explanation ❤
@NameNotFound934
@NameNotFound934 Жыл бұрын
Many people comment here to add "dead state". But dead/trap state is not mandatory to add for 'phi'.
@xipingpungi2936
@xipingpungi2936 3 ай бұрын
Less than 12 hours left and i am watching😅
@kalgikansara7369
@kalgikansara7369 4 жыл бұрын
Do I need to write formula explaination for all ...or tables are ok??
@jorelletuyor
@jorelletuyor 4 жыл бұрын
Thank you mam for making us understand more with this tutorial.Thank you and God bless you always.❤😇
@amoldangat007
@amoldangat007 3 ай бұрын
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_films
@shrinidhijag_films 2 жыл бұрын
Thanks you ma'am this made my life peaceful 🥰
@swastik4685
@swastik4685 2 жыл бұрын
Less than 2 hours for internal, and I'm watching this here
@bhanupratapshishodia3027
@bhanupratapshishodia3027 2 жыл бұрын
Thanks mam you are teaching awesom every student cal easily learn keet up mam
@CodewithAshwani
@CodewithAshwani 2 жыл бұрын
Easy to understand with no doubts.thank you mam.
@i__sandesh
@i__sandesh 3 ай бұрын
This is epsilon nfa to without epsilon nfa, but not a dfa, since all of the alphabets are not used in each states.
@madhumohanajv9942
@madhumohanajv9942 Жыл бұрын
Very clear explanation ma'am,thanks a lot ♥️🙌
@redcodes2354
@redcodes2354 19 күн бұрын
Mam do we need to draw the transitions for ɸ also in DFA?
@sarthakn4398
@sarthakn4398 Жыл бұрын
This helped me a lot ❤ Thank you
@Sharath-m8l
@Sharath-m8l 6 күн бұрын
2 hours before sem exam watching this....🙃🫣
@statusgallery9126
@statusgallery9126 6 күн бұрын
Same
@JohnSmith-xg5wh
@JohnSmith-xg5wh 3 жыл бұрын
I believe for a DFA must have an exiting transition arrow for every symbol in its alphabet but good video
@ZeeshanKhan-zf9os
@ZeeshanKhan-zf9os 3 жыл бұрын
Yes u r right bro
@ZeeshanKhan-zf9os
@ZeeshanKhan-zf9os 3 жыл бұрын
We should take a dead state
@dhakshinyabg6874
@dhakshinyabg6874 2 жыл бұрын
Is it possible that a DFA contains only the final state
@shwetathakare1556
@shwetathakare1556 9 ай бұрын
Clearly understood the concept thank you ❤
@nathimarygrace2973
@nathimarygrace2973 3 жыл бұрын
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
@mahimarai6197
@mahimarai6197 3 жыл бұрын
Is this also for conversion of €NFA to it's equivalent DFA? Ma'am
@av76475
@av76475 2 жыл бұрын
this was great, saved me a lot of time, thank you
@divyeshkoli2239
@divyeshkoli2239 8 ай бұрын
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
@charanchalamasetty9427
@charanchalamasetty9427 3 жыл бұрын
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?
@UpYourHand
@UpYourHand 5 ай бұрын
Guys please read the description ma'am has mentioned the dead state...🙂
@jigarmaheshvari8319
@jigarmaheshvari8319 3 жыл бұрын
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?
@ensainlearner
@ensainlearner 3 жыл бұрын
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 😁
@vibhu613
@vibhu613 3 жыл бұрын
@@ensainlearner it's not rule??
@AdityaSingh-zk3fe
@AdityaSingh-zk3fe 3 жыл бұрын
This is so helpful. Thank you ma'am
@BirdOnBlueSky
@BirdOnBlueSky Жыл бұрын
Thank you for your detailed explanation!
@QuantumGaming149
@QuantumGaming149 2 жыл бұрын
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
@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
@simonlorimer5822
@simonlorimer5822 3 жыл бұрын
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?
@anitar8483
@anitar8483 3 жыл бұрын
Can you send the question (€- NFA)?
@Krishna-xz4zd
@Krishna-xz4zd 3 жыл бұрын
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
@deviprasadgm Жыл бұрын
Excellent teaching....thank you mam
@snehaljadhav4080
@snehaljadhav4080 3 ай бұрын
thank you mam, very easily explained
@ZynoxOfficial007
@ZynoxOfficial007 11 ай бұрын
But dfa must use all the output(a,b,c) symbol,here B,C don't use all output symbol
@jacknicholas1564
@jacknicholas1564 2 жыл бұрын
Usumularsey in the background 🔥
@piotrlezanski5156
@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-ness2280
@virral-ness2280 2 жыл бұрын
Less than 1 hour left from exam, agar ye paper me aya to maja aayega pure marks ☺
@swordlion294
@swordlion294 2 жыл бұрын
The best explanation, period.
@Updeus
@Updeus 2 жыл бұрын
you forgot the transitions to the dead state for the DFA
@akulavarshith6379
@akulavarshith6379 11 ай бұрын
Mam how to find the union i we have q1,q2
@sujithnarayan5335
@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
@okaudi
@okaudi 2 жыл бұрын
I lost in the DFA first state {q0,q1,q2}a -> {q0,q1,q2}, Can anyone explain that why ?
@surya4575
@surya4575 4 ай бұрын
self looping
@relmimaryk.j.368
@relmimaryk.j.368 Жыл бұрын
So there is no need to mark phi as qtrap in dfa?
@xyz-qz2ob
@xyz-qz2ob Жыл бұрын
There should be square brackets not curly braces in DFA table
@mayankpathak07
@mayankpathak07 2 жыл бұрын
Less than 9 hours remaining for sessional exam and i am watching this
@santhisri9129
@santhisri9129 3 жыл бұрын
Mam if there is no input symbols then what were we do
@mrak1248
@mrak1248 2 жыл бұрын
Mam is there possible 'pi' in DFA Why didn't use dead state
@prithvirajsainiranjan6240
@prithvirajsainiranjan6240 Жыл бұрын
Guys in place of phi put (qt) and keep it as dead state
@Sinchan_kundu
@Sinchan_kundu 2 ай бұрын
thank you very much maam very helpful
@aayushbajpai3793
@aayushbajpai3793 2 жыл бұрын
Less than 6 hrs left to declare my Sem result....and I'm watching this video...lmao
@vipinkadu2393
@vipinkadu2393 11 ай бұрын
Less than 1 hour remaining and i will watching video....moye moye😢
@suhaskubasad9141
@suhaskubasad9141 Жыл бұрын
mam i think u have a converted epsilon NFA to NFA rather than DFA, but still it was helpful
@madasuumamahesh5116
@madasuumamahesh5116 2 жыл бұрын
SUPER EXPLANATION MAM TO UNDERSTAND😇
@varunjojare
@varunjojare Жыл бұрын
thank you!! Finally understood
@abhivish2017
@abhivish2017 Жыл бұрын
Very well explained ma'am
@kprasanthkumar1815
@kprasanthkumar1815 3 жыл бұрын
Very Good Explanation Madam
@kalpeshm9852
@kalpeshm9852 Жыл бұрын
Thank you mam ☺️ clearly explained
@blakemosley4796
@blakemosley4796 9 ай бұрын
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.
@mohammedzainkhazi7667
@mohammedzainkhazi7667 3 жыл бұрын
Undrstood Well but I'm having doubt...........what if there is string after (q2) at least it should go to dead state na
@shashidharnagaral103
@shashidharnagaral103 3 жыл бұрын
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'.
@tailung6334
@tailung6334 2 жыл бұрын
mam null shouldnt be there for DFA trans table right ?? so we have to include a dead state instead of NULL ???
@togya4
@togya4 Жыл бұрын
girl your are the best
@anuragprajapati3712
@anuragprajapati3712 3 ай бұрын
the solution is wrong , the solution explained in this video is to convert from epsilon nfa to dfa !
@anuragprajapati3712
@anuragprajapati3712 3 ай бұрын
epsilon nfa to nfa
@nithiyasris1485
@nithiyasris1485 4 жыл бұрын
Thank you mam... It's very understandable...
@Pikachu77504
@Pikachu77504 2 жыл бұрын
Thnx a lot mam..it's really helpful
@amrutamitti2596
@amrutamitti2596 3 жыл бұрын
Thnx mam. It's very understandable
@Samaraa1222
@Samaraa1222 3 ай бұрын
Where are the trap sttaes ma'am
@nithin1729s
@nithin1729s 9 ай бұрын
but isnt that a NFA at the end ???
@baboucarrgibba9336
@baboucarrgibba9336 Жыл бұрын
great explanation
@ayyappareddy4461
@ayyappareddy4461 3 жыл бұрын
Awesomeeee explaination madammm
@poorniman7726
@poorniman7726 2 жыл бұрын
Supr mam ....understood clearly.
@AfraimZahangir
@AfraimZahangir 4 жыл бұрын
what about the fi???
@wednesdayaddams718
@wednesdayaddams718 2 ай бұрын
Thanks a lot mam it saved me
@damnengineering26
@damnengineering26 11 күн бұрын
diagram does not have dead state
@prajakthapprabhu6103
@prajakthapprabhu6103 2 жыл бұрын
Mam plz Focus the paper properly...it keeps getting blurry
Theory of Computation: Conversion of Epsilon-NFA to NFA
11:41
Theory of Computation: NFA to DFA conversion Example
9:09
Anita R
Рет қаралды 201 М.
Creative Justice at the Checkout: Bananas and Eggs Showdown #shorts
00:18
Fabiosa Best Lifehacks
Рет қаралды 33 МЛН
Conversion of NFA to DFA (Powerset/Subset Construction Example)
12:31
NFA To DFA Conversion Using Epsilon Closure
7:08
TutorialsPoint
Рет қаралды 338 М.
Conversion of NFA to DFA
9:28
Neso Academy
Рет қаралды 1,5 МЛН
Conversion of Epsilon NFA to NFA
9:41
Neso Academy
Рет қаралды 1,1 МЛН
Creative Justice at the Checkout: Bananas and Eggs Showdown #shorts
00:18
Fabiosa Best Lifehacks
Рет қаралды 33 МЛН