Lecture 3/65: Finite State Machines: Examples

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.

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!!!

i dont know why you made 4 accept states. You could of simplified that so it does not accept it with only 1 state

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.

love your way of explaining, plan to watch every video

Excellent!

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.

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.

thx

thanks man you saved my ass

"It" is often a cancerous word when discussing Mathematics.

You definitely have a way of explaining things that do justice to the information.

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 (?).

You are a saint.

Really awesome lectures! I understood everything and would heartily like to thank you. You're truly "magical", arrived I think from Hogwarts.

Excellent! Love the examples and the presentation on why some FSM are not regular.

Dude... you videos are saving my ass this semester. The book doesn't explain it this well at all.

"once you get to the dead state, you stay in the dead state", that seems quite logical :))

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?

"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.

Fuckkk offf you are messing everything uppp

you should have specified the direction you are reading the binary
string from

Your lectures are fantastic and your examples are very clear. Thank you for sharing.

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.

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?

In the last example, why stateA is being marked as both the starting state and final state ?

thank youu!!!!!