Binary "multiples of two" should end on a 0, e.g. 10, 0001010, 0100, etc. Example at around 6:00 should really read "binary strings with even-numbered occurrences of 1 in them".
When I was earning my master's degree, I heard a lot about finite state machines (FSMs), but it was all theory - like clouds in the sky: there's a lot of water, but you can't drink it. I toiled for three months after graduating until I implemented my first FSM in code in 1981. Now, there is a programming methodology based on this concept - v-agent oriented programming (VAOP) - with many examples of its implementation. It's best to start learning about VAOP with this article on Medium: "Bagels and Muffins of Programming or How Easy It Is to Convert a Bagel into a Black Hole".
i would have thought that multiples of two you mean 10, 100 , 110, since these are 2,4,6 and so on.. so everything that ends with a zero should be a multiple of two in a binary language..
In the 2nd example, the one which sigma was: 0, 1, 2, R, shouldnt the acceptance case be like this: If the input ends in an R(Reset) or a multiple of 3, then it is accepted ? THanks
Interesting! I've not seen them used like this. Maybe these are an edge labeled finite state machines paths. Rather than typical vertex traversal histories of an edge probability/weighted finite state machine.
Would be nice to have a video that covers more complicated examples, like if the second example was interpreted as binary and you wanted to only accept strings divisible by 3.
Hey thanks for the series! Helped a lot throughout my discrete math course. May I ask, what was the name of the textbook you used in making this series?
Sorry if this isn't the right video for me to post this question on, but I was given a problem that I don't fully understand what to do with. It says to "Give an informal description of a deterministic Turing Machine for the language L = {w0w|E{0,1}*}" (the E is supposed to be "is an element of", but I couldn't find the symbol online) ... So with this problem, am I supposed to think of a way that this machine could be useful in real life?
+Laura Adams "Informal description of a DFA" usually means "describe what kinds of strings are accepted by the language." You were given the formal description (i.e., a math description).
The DFA for multiples of two is wrong. An even or odd number of ones makes absolutely no difference in whether the number is a multiple of two. All binary numbers with a zero as the least significant digit is even, and consequently, a multiple of two. In your example 10 (2) is not a multiple of two. Really?
![[Discrete Mathematics] Finite State Machines Examples](http://i.ytimg.com/vi/NZ29R2D3rNA/mqdefault.jpg)
![[Discrete Mathematics] Finite State Machines Examples](/img/tr.png)
Binary "multiples of two" should end on a 0, e.g. 10, 0001010, 0100, etc. Example at around 6:00 should really read "binary strings with even-numbered occurrences of 1 in them".
exactly
When I was earning my master's degree, I heard a lot about finite state machines (FSMs), but it was all theory - like clouds in the sky: there's a lot of water, but you can't drink it. I toiled for three months after graduating until I implemented my first FSM in code in 1981. Now, there is a programming methodology based on this concept - v-agent oriented programming (VAOP) - with many examples of its implementation. It's best to start learning about VAOP with this article on Medium: "Bagels and Muffins of Programming or How Easy It Is to Convert a Bagel into a Black Hole".
i would have thought that multiples of two you mean 10, 100 , 110, since these are 2,4,6 and so on.. so everything that ends with a zero should be a multiple of two in a binary language..
Great course! would be great if u continued the videos to non determinisit automata and so on..
In the 2nd example, the one which sigma was: 0, 1, 2, R, shouldnt the acceptance case be like this: If the input ends in an R(Reset) or a multiple of 3, then it is accepted ?
THanks
11:16, Shouldn't it be there 2 2 instead of 2 1 for going to q2 and then to q1?
Interesting! I've not seen them used like this. Maybe these are an edge labeled finite state machines paths. Rather than typical vertex traversal histories of an edge probability/weighted finite state machine.
Would be nice to have a video that covers more complicated examples, like if the second example was interpreted as binary and you wanted to only accept strings divisible by 3.
So much better than my professor from china! Thanks dude
and also better than my teacher.
Hey thanks for the series! Helped a lot throughout my discrete math course. May I ask, what was the name of the textbook you used in making this series?
Book of proofs
there is a mistake around 11:33, it should be if q2 wants to go back q1 is 2,2. if q2 wants to go back q0 is 2, 1
helped for my exam
great video!
this was amazing, thank you
Sorry if this isn't the right video for me to post this question on, but I was given a problem that I don't fully understand what to do with. It says to "Give an informal description of a deterministic Turing Machine for the language L = {w0w|E{0,1}*}" (the E is supposed to be "is an element of", but I couldn't find the symbol online) ... So with this problem, am I supposed to think of a way that this machine could be useful in real life?
+Laura Adams "Informal description of a DFA" usually means "describe what kinds of strings are accepted by the language." You were given the formal description (i.e., a math description).
god that multiples of two one was crazy once it clicked
The DFA for multiples of two is wrong. An even or odd number of ones makes absolutely no difference in whether the number is a multiple of two. All binary numbers with a zero as the least significant digit is even, and consequently, a multiple of two. In your example 10 (2) is not a multiple of two. Really?
hey dud, whats R at 09.28?
"reset"
thanks a lot, for my final exam sir. u r peaking!!
speed 1.5x. cool video
2x or bust
i am sorry but i didnt get the part where he adds 2+2+2=3???
2 + 2 is 4 + 2 is 3 quick maffs
its a typing error, however 2+2+2=6 which passes the 0=mod 3 check which makes it a valid input!
Use combinatorial arguement
2+2+2=6 i couldnt get it
vending machines
you explain stuff 2 quick slow down man!!1
can you explain this better in another video