At 9:30, you say that the FSM must end in a 1, but a 0 from q1 would result in q2, which looks like an acceptable end state. Is this an error or am I reading it incorrectly? Thanks for all your videos, you're helping me out a ton with my DM course!
@@davidsantos7006 Yeah, definitely a mistake in the transitions. q1 transition on a 0 should be to q1 if he wants it to work as he described it, that would accept strings with at least 2 1s and ending on a 1.
I was hoping you already had a complete series for this one, but okay. I love your videos, they helped me a lot!
Do you know a good youtube channel on theory of computation. If yes, I would be genuinely grateful if you recommend.
At 9:30, you say that the FSM must end in a 1, but a 0 from q1 would result in q2, which looks like an acceptable end state. Is this an error or am I reading it incorrectly? Thanks for all your videos, you're helping me out a ton with my DM course!
Did you ever get a answer? I am reading it the same way you are and I’m confused 😭
@@davidsantos7006 Yeah, definitely a mistake in the transitions. q1 transition on a 0 should be to q1 if he wants it to work as he described it, that would accept strings with at least 2 1s and ending on a 1.
Already donated via PayPal. Such a great channel!
This is extremely amazing! I do love your channel, and especially these series! Thank you so much!
Thank you very much for your coverage! I understand the subject a lot better now :D
no intention to continue the series? you are great!
at 13:55 you say that the machine will take 0 and accept but wouldn’t that be a odd number of zeros so we would be at q1?
Yes, he made lots of mistakes this video.. very confusing
Very clear, tks
Great vid dude. Thanks a lot!
very helpful video...
In the last exercise, how are 1001 and 1000 valid answers?
@robphin85 for 1011 start state is qo then 1 goes to q1 then for 0 it goes to q2 then 0 again it goes back to q1 then another 1 it goes to q2 -> ends
Omg so much better when it’s typed down than written on