At 03:45, Your conclusion is dangerous. It only works for these particular automata because the first automaton has q0-a-q1-a-q2 and the second automaton has q0-b-q1-b-q2. That is not the case for arbitrary automata. The naming scheme for the states of the new automaton is correct and follow the pattern, but you have to do the state transitions one by one, without taking any shortcuts.
I thought the pattern would make the algorithm more obvious, but I might be wrong. Thanks for your comment, which might help viewers who got confused about that point.
helped me figure my homework out, but I am guessing that not all intersections will have a final state? I used L1 = {a, b} with a = 2, b = 2 and L2 = {a, b} with a = 1, b = 2. Start with 0 state for both, but F1 = {8} and F2 = {5}. Since L2 doesn't have the last column, 85 will never intersect. But if i move the final state to within the 1st 2 columns, then L intersection does have a final state.
You're right and you can see it with very simple examples. Take two automata without any final state, then the intersection also will have no final state. Or take one automata that accepts only "a" and the other one that accepts only "b", then there also will be no final state.
Any example is helpful to an extent. In this video, methodology and example are presented together in one. You have to apply this logic to your specific problem.
I'm certain that all of the information is present in your video, however it was not delivered in a way that is easy to understand. I watched your video 3 times and was not able to follow what you were doing. But you have 10 likes so clearly it was helpful to some people. I'm just not one of them.
Thanks for your reply. I figured that what helps most people is doing a task like they're supposed to do and to use colors to show what belongs to each other. I'm really interested in what helps others like you. Are you the kind that prefers written text over videos? Could it help if I showed the construction with the transition table? Or the math behind it? Maybe you're coming from a different background of knowledge than my other viewers? So many questions ... If you think this won't work out anyway, you don't need to answer.
I will only be able to answer this question when I have finally understood the material. I can't tell you how to better explain something; if I still don't understand. So, when I understand; which I will eventually, I will be back to answer this question. I do however think it would be helpful to have added the regular expressions or description of what the diagrams are able to accept . (I'm referring to the image of the two respective diagrams that you start out with.) I assume my background is the same as most watching this video: Computer Science/ Mathematics student @ a University. i unsterstand most of this subjects concepts, I'm simply having trouble understanding a systematic or algorithmic approach to getting the intersection of DFAs for some reason.
At 03:45, Your conclusion is dangerous. It only works for these particular automata because the first automaton has q0-a-q1-a-q2 and the second automaton has q0-b-q1-b-q2. That is not the case for arbitrary automata. The naming scheme for the states of the new automaton is correct and follow the pattern, but you have to do the state transitions one by one, without taking any shortcuts.
I thought the pattern would make the algorithm more obvious, but I might be wrong. Thanks for your comment, which might help viewers who got confused about that point.
Picked up the pattern fairly quickly. Thanks.
This was a very helpful video, thank you for uploading it!
Thanks so much, I was a little confused with intersections, but this cleared things up for me!
Thank you for making this video. Helpful
Excellent video! Helped me understand my homework!
helped me figure my homework out, but I am guessing that not all intersections will have a final state? I used L1 = {a, b} with a = 2, b = 2 and L2 = {a, b} with a = 1, b = 2. Start with 0 state for both, but F1 = {8} and F2 = {5}. Since L2 doesn't have the last column, 85 will never intersect. But if i move the final state to within the 1st 2 columns, then L intersection does have a final state.
You're right and you can see it with very simple examples. Take two automata without any final state, then the intersection also will have no final state. Or take one automata that accepts only "a" and the other one that accepts only "b", then there also will be no final state.
Very awesome video! Straight to the point, I love it! You also sound very very young. You are quite the genius. Keep up the great work young man.
Great video, it helped a lot. Thanks!
perfect explanation .thanks 🤎
Helped a lot, thanks!
This helped me so much, thank you!!!
You're welcome, I'm glad it helped. :)
Helped me a lot
Anyone from gfg que 46 ?
still not getting it
What information do you need to understand?
this was not helpful at all
What would be helpful to you? Is the video not showing something you need to know but would belong here or are you looking for anything else?
Any example is helpful to an extent. In this video, methodology and example are presented together in one. You have to apply this logic to your specific problem.
This did not help me...at all.
What information do you miss?
I'm certain that all of the information is present in your video, however it was not delivered in a way that is easy to understand. I watched your video 3 times and was not able to follow what you were doing. But you have 10 likes so clearly it was helpful to some people. I'm just not one of them.
Thanks for your reply. I figured that what helps most people is doing a task like they're supposed to do and to use colors to show what belongs to each other.
I'm really interested in what helps others like you. Are you the kind that prefers written text over videos? Could it help if I showed the construction with the transition table? Or the math behind it? Maybe you're coming from a different background of knowledge than my other viewers?
So many questions ... If you think this won't work out anyway, you don't need to answer.
I will only be able to answer this question when I have finally understood the material. I can't tell you how to better explain something; if I still don't understand. So, when I understand; which I will eventually, I will be back to answer this question. I do however think it would be helpful to have added the regular expressions or description of what the diagrams are able to accept . (I'm referring to the image of the two respective diagrams that you start out with.) I assume my background is the same as most watching this video: Computer Science/ Mathematics student @ a University. i unsterstand most of this subjects concepts, I'm simply having trouble understanding a systematic or algorithmic approach to getting the intersection of DFAs for some reason.