[Discrete Mathematics] Finite State Machines

9 років тому

We do a quick introduction to finite state machines, creating our own, understanding what they do, and abstracting the purpose of these machines.
Visit our website: bit.ly/1zBPlvm
Subscribe on UKposts: bit.ly/1vWiRxW
-Playlists-
Discrete Mathematics 1: • Discrete Math (Sets, L...
Discrete Mathematics 2: • Discrete Math (Countin...
-Recommended Textbooks-
Discrete and Combinatorial Mathematics (Grimaldi): amzn.to/2T0iC53
Discrete Mathematics (Johnsonbaugh): amzn.to/2Hh7H41
Discrete Mathematics and Its Applications (Rosen): amzn.to/3lUgrMI
Book of Proof (Hammack): amzn.to/35eEbVg
Like us on Facebook: on. 1vWwDRc
Hello, welcome to TheTrevTutor. I'm here to help you learn your college courses in an easy, efficient manner. If you like what you see, feel free to subscribe and follow me for updates. If you have any questions, leave them below. I try to answer as many questions as possible. If something isn't quite clear or needs more explanation, I can easily make additional videos to satisfy your need for knowledge and understanding.

КОМЕНТАРІ: 33

@gerhardlourens 3 роки тому

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

@ayanaxhye Рік тому

exactly

@katarinawatt6110 6 років тому

this was amazing, thank you

@elyasaf755 5 років тому

Great course! would be great if u continued the videos to non determinisit automata and so on..

@alternativelife596 4 роки тому

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

@kaushikraghupathrunitechie 8 років тому

helped for my exam

@alan2here 3 роки тому

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.

@AccuphaseMan 5 років тому

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.

@loadedbylarry 4 роки тому

great video!

@sayedabdullahqutb8851 5 років тому

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

@imranahmadov2463 7 років тому

11:16, Shouldn't it be there 2 2 instead of 2 1 for going to q2 and then to q1?

@soupra777 6 років тому

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?

@vrundavarvedia530 6 років тому

Book of proofs

@user-lh2fr6xy1o 2 дні тому

god that multiples of two one was crazy once it clicked

@MessedUpGaming 8 років тому

So much better than my professor from china! Thanks dude

@flyingbirds4235 5 років тому

and also better than my teacher.

@turbocrackers2204 8 років тому

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?

@Trevtutor 8 років тому

+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).

@stevesun1530 5 років тому

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

@alitokur2729 7 років тому

hey dud, whats R at 09.28?

@Trevtutor 7 років тому

"reset"

@alitokur2729 7 років тому

thanks a lot, for my final exam sir. u r peaking!!

@hasanmetin8085 Рік тому

2+2+2=6 i couldnt get it

@joetroia6629 4 роки тому

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?