you just saved me so much time! The fact that you also went through how to simplify a dfa!! this vid is just too good. i dont usually comment on stuff but you may have just saved me from failing my exam tomorrow as well as saving me from sleep deprivation. Thank you!
Hey that was a great explanation! I would like to add that the DFA states must have transition for every "letter" in the language. Here you omit the transitions leading to the empty set, e.g. transition 1 of state 1, transition 0 of state 3 and transition 1 of state {1,5}
@@ballknower445 most likely yes. if there are valid transitions then there should be a dead state. there should always be an outcome of an action until the algorithm is done.
I think I love you(Context: Finding the answer to my question lol), kidding. But in all seriousness Thank you so much. You literally just cleared up all of my confusion with how to tackle my homework. Hope you're having a blessed day.
Thank uh so much Ilene for educating us! It feels like it was really difficult when Prof. explain to us. But watching UA-cam videos and learning is the best thing one can get!
I think when you’re trying to get rid of some states cause of they lead to same states as others . You have to make sure the no one of them is an exception state . Thank you ❤ you helped me❤
OMFG. THANK YOU SO MUCH ILLENE. First midterm on theory of computation in 10 hours and this video explained it so so so so well. You are amazing!!!!!!!!!!!!!!!!!!!
thanks for the video you answered the question of what to do when you have multiple nodes with multiple destinations. you just combine them into a bigger node !
She didn't specify, but the starting state of the DFA is eps(q), where q is the starting state of the NFA. In this example, the starting state of the DFA is 1 because eps(1) = {1}, or just 1. Also, as I type this, I realize that it may not be necessary to compute eps() for the rest of the states in the NFA table.
new subscriber!, i found it helpful through the comment section also. The thing is that I'm confused on the first state that I thought it was wrong and then I ahead here Hahahaha God bless!
thank you Ilene. great video. the nfa table to dfa table was very helpfull. the DFA is incorrect and needs fixed for an instructional video. every transition must be mapped per properties of DFA
By the definition of a DFA each state should have one transition for each input on the input alphabet. Doesn't this mean your solution is incorrect? Pretty sure you just need to have a trap state for null transitions.
If you had an epsilon transition from state 1 to state 2 (and only an epsilon transition) you had to unify those states first. Otherwise you couldn't even get started with the DFA table creation using this method.
Yes. But there is a common understanding that the letters not included lead to a dead state. It's a convention to omit them just to have simpler diagrams.
Great video but I would like to ask what happens when the first state transits to other states only with e (For Example: δ = 1, 0 = ∅, 1 = ∅, ε = {2,4} )
If u are my flat teacher than for sure I am the next automata scientist.
you just saved me so much time! The fact that you also went through how to simplify a dfa!! this vid is just too good. i dont usually comment on stuff but you may have just saved me from failing my exam tomorrow as well as saving me from sleep deprivation. Thank you!
This video is so helpful for me to understand those material and her pronunciation is so CLEAR. Nice video!
my friend really loved this video he said it helped him so much in his exam.
9:40 Thank god indeed lol, this was a very thorough and helpful walkthrough. Thank you!
Hey that was a great explanation!
I would like to add that the DFA states must have transition for every "letter" in the language. Here you omit the transitions leading to the empty set, e.g. transition 1 of state 1, transition 0 of state 3 and transition 1 of state {1,5}
Glad you found the video useful. Yup you’re totally right about that. Thank you Tri!
right and these would lead to a new state "7" which is the dead state.
@@danteeep so a solution to the problem , if I were to follow the video, would be to simply add a dead state that all of those would go to?
@@ballknower445 most likely yes. if there are valid transitions then there should be a dead state. there should always be an outcome of an action until the algorithm is done.
@@danteeep that makes sense, thanks!
I think I love you(Context: Finding the answer to my question lol), kidding. But in all seriousness Thank you so much. You literally just cleared up all of my confusion with how to tackle my homework. Hope you're having a blessed day.
Tysm, you explained that very short and sweet, also pretty much explained simplifying dfas as well quickly, valid video bro
Thank uh so much Ilene for educating us! It feels like it was really difficult when Prof. explain to us. But watching UA-cam videos and learning is the best thing one can get!
Bless your soul! You explain it more clearly than my prof!
Best explanation I have seen of this on youtube
I've liked your explanation which was very clear , good job. Thanks a lot from Tunisia.
Arigatō, your video was helpful and you explained it more clearer than my professor. Please keep uploading more tutorials.
I think when you’re trying to get rid of some states cause of they lead to same states as others .
You have to make sure the no one of them is an exception state .
Thank you ❤ you helped me❤
oh my goodness. You are so smart. Can't wait to keep learning from you!
Wow, thank you! I didn't even know how easy this could be with those tables.
You explained this in a really concise way! Thank you!
OMFG. THANK YOU SO MUCH ILLENE. First midterm on theory of computation in 10 hours and this video explained it so so so so well. You are amazing!!!!!!!!!!!!!!!!!!!
No problem! Glad I could help; hope your exam went well :)
you explanation is so simple and effective, please make more videos 😊
thanks for the video you answered the question of what to do when you have multiple nodes with multiple destinations. you just combine them into a bigger node !
thank you so much. you have no idea how much you've helped me
THANK YOU this was exactly what I needed! It's SO much clearer now!
That's so easy to understand. I truly appreciate your effort :) Love you
Wow good job 👍
You deserve one million subscribers.
You deserve more subscribers. Well done
Wow! So Clear! That was one of the best explanations.
OMG Ilene. I was struggling to learn this and then I saw your channel. Good explanation!!
Haha really?! 😂 glad it helped
Thanks a lot this video is so helpful
we are waiting for more videos
She didn't specify, but the starting state of the DFA is eps(q), where q is the starting state of the NFA. In this example, the starting state of the DFA is 1 because eps(1) = {1}, or just 1. Also, as I type this, I realize that it may not be necessary to compute eps() for the rest of the states in the NFA table.
So helpful! This was way easier to understand than my professor lol
new subscriber!, i found it helpful through the comment section also. The thing is that I'm confused on the first state that I thought it was wrong and then I ahead here Hahahaha God bless!
I'm the 15,000 viewer lets go!! Saving me from failing my midterm tomorrow thanks for the video.
You're a life saver that sent from heaven. Arigato gozaimasu!
i was confused why the DFA has the same number of states as the power set of the NFA's states. this explains it!!!
This was so helpful!! Thank you so much
You saved my life very well explained ty
thank you Ilene. great video. the nfa table to dfa table was very helpfull. the DFA is incorrect and needs fixed for an instructional video. every transition must be mapped per properties of DFA
Hi Ben, thank you for the feedback. I understand your point. What you’re saying is correct.
The convention is that the omitted transitions are commonly understood to transition to dead state.
Very well explained thx from India
By the definition of a DFA each state should have one transition for each input on the input alphabet. Doesn't this mean your solution is incorrect? Pretty sure you just need to have a trap state for null transitions.
Yeah I thought so too
hi Ilene. i'm confusing at 4:34. are you taking the number from the epsilon column or it is just a pure coincidence that the numbers are the same ?
how do you decide which state tyo keep between 1 and 4 when simplifying {1,4}?
actual good explanation
Thank you, this helped me a lot.
when simplifying can you get rid of either state or do you have to get rid of a certain one?
If you had an epsilon transition from state 1 to state 2 (and only an epsilon transition) you had to unify those states first. Otherwise you couldn't even get started with the DFA table creation using this method.
Nice explanation sister.
Thank you so much you just saved me
Thank you, your video really helped
Lol "Thank god" I felt that
wow awesome video
Thanks for making automata less cancer
Fantastic! A life saver
Almighty Bless you with all kinds of wealth
what a good video
Really helpful!!! Thanks
Great video, very helpful. Don't DFAs have to have outgoing arrows from each letter of the alphabet tho?
Yes. But there is a common understanding that the letters not included lead to a dead state. It's a convention to omit them just to have simpler diagrams.
thank you aline
thank u
Thank you so much
Great video but I would like to ask what happens when the first state transits to other states only with e (For Example: δ = 1, 0 = ∅, 1 = ∅, ε = {2,4} )
Well when we define an empty state for our dfa, your mentioned state will get connected to that
thank you queen!
Where is the second vid? 🥺
awesome, thanks!
Today was my TOC exam..... I don't know why am I watching this now🌚😜
Thank You
I really appreciate the 1st half but 2nd half was wrong
WHY DID YOU STOP MAKING VIDEOS ? :(
Thanks
Thanks sis
love it
Thank youuuuuuu
thanks!
aaaaaaaaaaaaaa thank you very much!
I have a question, how do I turn into your DFA? 😏
sorry... what?
@@VulsikDoSurilim hear me out...
@@musicplaylist6909 I'm not entirely sure I want to.
@@VulsikDoSurilim do you know her @?
so helpful, and the way you talking is hot hot hot
😍
How can I contact you?
You are cute and smart
This method does not work!
she's hot and she explains well, NANI???????
Nice video maam do reply on comment of mine...maamm😄
why are you beautiful cause i didnt understand anything
mal madam
Nice. Can i convert YOU to MBW? (My Beautiful Wife) xd
I am sorry but this does not make any sense
ednakazuya12 I believe this requires prior knowledge in formal languages and automata. It’s more of an intermediary tutorial