Proff...i just want to thank you a lot ...prof...i owe you sir...thanks ..because of your knowledge that you shared.. i have passed my remaining course and now I got my degree...thanks very much!!!
The part about regular languages makes so much sense compared to my lecture, which was essentially: "if the grammar rule looks like this, it is regular". No explanation whatsoever... Thank you so much, Professor Harry Porter.
At 28:17, I think the finite state machine that you built is a bit wrong. If the input was ε, the finite state machine would recognise it, but it actually shouldn't, because nothing is not divisible by 3 (also, ε is not part of the set that you said you are going to represent as a finite state machine).
Thank you Sir. I'm planning to complete this series. I shifted here because the elaboration on the videi about infinity is much more lucid. I can't thank you enough.
"if its a 0 it has the effect of multiplying that by 2.." why am i not able to get this? I listened to this part 3 times. What does that X stand for? Please someone help me understand.
Okay. I finally got this. What he means is if in binary you have 1 placing 0 next to it would result in '10' which doubles the value in the decimal number system. and if you place 1 next to 1 to it would result in '11' and would be 1 less than '100'. More examples, 111--> (1000 -1), 1111-->(10000-1). I'd not thought of it this way. Thank you.
A string with no length is like a dimensional entity with no parts, in that it is a machine node corresponding axiomatically with a geometric point. Very convenient for graphing, that.
A very good lecture series. However, I think there is a little mistake in the wording. When you speak of the opposite set you speak of "compliment", while it should be "complement" (10:38). Other than that I learned a lot here. THX for laying everything out so concisely and clearly. Great didactics!
So even though you could create a finite state machine that can accept strings with the same amount of leading zeros as trailing ones up to an arbitrary length n, you would need it to be an infinite size to handle the general case?
What do the symbols actually represent on an individual level? Is it just used as a way to to categorize transitions, that's the only thing that makes sense to me. Do the symbols have further meaning?
Excuse me sir - but I can't seem to get your formula for binary conversion verified: If i check it for '1101', for example, your recursive formula yields 11, but it should be 13. Am I missing something? I understand that the base assumption is that the previous numbers aren't all zeroes, or the recursion would fail as well (?).
states represent remainders of division by 3, so because we want to achive remainder of 0. And the first binary number divisible with 3 is 0. 0 is divisible with any number with remainder of 0 in theory.
Great video. But I have a question. In the example of giving the FSA that does not recognize the string 0011 in it. Is there a straight forward way to know how many states will the transition diagram have? How did you know in the solution that there were going to be 5 states? Thank you.
Felix Cabrera start with q and then need a 0 then another zero and a 1 and a 1, so needs 4 states more... from the starting state with a zero you go to to the next state and are closer to F and then with a zero to another state and get closer even... do I explain myself, would believe it is starting plus characters in w?
Proff...i just want to thank you a lot ...prof...i owe you sir...thanks ..because of your knowledge that you shared.. i have passed my remaining course and now I got my degree...thanks very much!!!
The part about regular languages makes so much sense compared to my lecture, which was essentially: "if the grammar rule looks like this, it is regular". No explanation whatsoever... Thank you so much, Professor Harry Porter.
love your way of explaining, plan to watch every video
Your lectures are fantastic and your examples are very clear. Thank you for sharing.
At 28:17, I think the finite state machine that you built is a bit wrong. If the input was ε, the finite state machine would recognise it, but it actually shouldn't, because nothing is not divisible by 3 (also, ε is not part of the set that you said you are going to represent as a finite state machine).
Thank you Sir. I'm planning to complete this series. I shifted here because the elaboration on the videi about infinity is much more lucid. I can't thank you enough.
You definitely have a way of explaining things that do justice to the information.
Thanks prof! Just one thing: I'm a learner so I actually got confused and had to go check this, but it's actually a complement, not a compliment.
"if its a 0 it has the effect of multiplying that by 2.." why am i not able to get this? I listened to this part 3 times. What does that X stand for? Please someone help me understand.
Okay. I finally got this. What he means is if in binary you have 1 placing 0 next to it would result in '10' which doubles the value in the decimal number system. and if you place 1 next to 1 to it would result in '11' and would be 1 less than '100'. More examples, 111--> (1000 -1), 1111-->(10000-1). I'd not thought of it this way. Thank you.
@Jeremiah Hammond I've edited. There was a mistake
A string with no length is like a dimensional entity with no parts, in that it is a machine node corresponding axiomatically with a geometric point. Very convenient for graphing, that.
Excellent! Love the examples and the presentation on why some FSM are not regular.
A very good lecture series. However, I think there is a little mistake in the wording. When you speak of the opposite set you speak of "compliment", while it should be "complement" (10:38).
Other than that I learned a lot here. THX for laying everything out so concisely and clearly. Great didactics!
So even though you could create a finite state machine that can accept strings with the same amount of leading zeros as trailing ones up to an arbitrary length n, you would need it to be an infinite size to handle the general case?
What do the symbols actually represent on an individual level? Is it just used as a way to to categorize transitions, that's the only thing that makes sense to me. Do the symbols have further meaning?
Excuse me sir - but I can't seem to get your formula for binary conversion verified: If i check it for '1101', for example, your recursive formula yields 11, but it should be 13. Am I missing something?
I understand that the base assumption is that the previous numbers aren't all zeroes, or the recursion would fail as well (?).
"once you get to the dead state, you stay in the dead state", that seems quite logical :))
In the last example, why stateA is being marked as both the starting state and final state ?
states represent remainders of division by 3, so because we want to achive remainder of 0. And the first binary number divisible with 3 is 0. 0 is divisible with any number with remainder of 0 in theory.
Dude... you videos are saving my ass this semester. The book doesn't explain it this well at all.
i dont know why you made 4 accept states. You could of simplified that so it does not accept it with only 1 state
Most likely for simplicity for the people who are learning it, not re-learning it.
You are a saint.
Excellent!
Great video. But I have a question. In the example of giving the FSA that does not recognize the string 0011 in it. Is there a straight forward way to know how many states will the transition diagram have? How did you know in the solution that there were going to be 5 states? Thank you.
Felix Cabrera start with q and then need a 0 then another zero and a 1 and a 1, so needs 4 states more... from the starting state with a zero you go to to the next state and are closer to F and then with a zero to another state and get closer even... do I explain myself, would believe it is starting plus characters in w?
Really awesome lectures! I understood everything and would heartily like to thank you. You're truly "magical", arrived I think from Hogwarts.
you should have specified the direction you are reading the binary
string from
thank youu!!!!!
thx
22:09
thanks man you saved my ass
that complement thing is genius btw
"It" is often a cancerous word when discussing Mathematics.