@@youngk9026 Maynbe, but I'm off the opinion most professors suck at teaching, and don't care to improve. At least that describes most of the professors I had in undergrad and graduate school.
Wow, I came here in an attempt to understand FSM. I liked the video. Then I look at the comments, and WHOA! Everyone down here is so satisfied with how you put up the explanation. I couldn't agree less. Thank you very much sir!
Dude thank you! I was told I should learn what a FSM is so I understood what the basics of it was in the wiki page but I decided to watch a video and you explained it way more in-depth. Thank you :) you earned a subscriber :D
I was shown this concept when I was a neophyte software engineer writing real time control software for telecoms systems in the 1980s (OMG a lifetime ago). I made a point of explaining this concept to every software engineer who ever worked for me in the next 40 years because it is such a simple, powerful and MOST IMPORTANTLY for process control - completely bulletproof. If Every state deals with every event (including those it should never see) you cannot break these systems. I wince at the lack of detailed understanding low level computer concepts in the 'Object oriented or nothing' - 'pythonesque' sofware developers I meet now. My degree is in Computer Science not Software engineering, and all we seem to train these days are 'coders' who barely warrant the title Software Engineer, as they understand few of the basic concept they're writing software on top of. I wonder how many of them could write Assembler, or optimise some P-code. Not necessary, but a skill that gives an important insight into what the machine is doing when it runs lazily written bloatware. Rant over :)
I was confused whenever i thought how can Moore machine work without i/p when you mentioned "time" immediately I understood it works on "triggering"(in this case the triggering is time) beautiful explanation you have my gratitude for clearing my concept sir, thankyou
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".
Brilliant! I got here after having a nightmare of a dream where I was presented a state machine in my Computer Engineering class and could not figure out what it was and my classmates understood it finished way ahead of me and me being the last one the professor yelling at me"what's taking so long dumba$$?" Now I am confident in can handle this in my dreams👍🏾🙌🏾🙏🏾
Thank you Abelardo Pardo for your effort. I have understood better from your explanation, than learning from Zyante Zybook, a College assigned material.
Thank You Professor Abelardo Pardo that is a great explanation it appears to me that there is 0 for open or null and a 1 for closed and positive while some are assigned not previously determined
tR is only 1 when the trucks are stopped. i believe the table is just laying out every possibility. if this were a real scenario i assume the trucks could still be waiting on Go if theres a huge traffic jam.
I don't understand, if the 1st Machine that you drew needed both the time input to be 1 AND the state to be xx, in order to change state, doesn't that mean that the output doesn't depend on the state rather than solely on input t? Am I missing something? Please correct me. Thank you.
+Mark Infinite Still looks like the output will regard both. The current state will not shift from green to red instantly nor will red switch to yellow regardless of the time input. Otherwise there would be no way to define the current state logically in the process in order for the timer to change it.
I don't understand the goal of a finite state machine, what about code implementation? A State machine use direct memory access or binary operations to evaluate it's next state, so how do you obtain that in your example?
So, a finite state machine an be defined in terms of a binary truth table? That reminds me of all the work I did in my Designing DIgital Systems class, although we didn't go over finite state machines.
Dear Mr. Abelardo Pardo, cold you help me ? I need project a FSM with follow fetures (2 bits machine, that recognize 1st sequence 0110, the output will be= 1, two sequences iquals 0110 0110, the 2nd the output, will be= 0, three sequences 0110 0110 0110, the 3r sequence output= 0) please how do I make this machine ? best regards. Paulo (Brazil)
+Trung Dũng Nguyễn à mình đang làm về cái này mà tìm code trên mạng toàn là mạch 2 cột đèn...có bài giảng này 1 cột mà mình khó hiểu quá mình k viết code đc.Bạn có code cái này không cho mình tham khảo với.Cảm ơn bạn nhiều :)
![Felix "Unfair" | [Stray Kids : SKZ-PLAYER]](http://i.ytimg.com/vi/Oswujxm2Ag0/mqdefault.jpg)
14 years back I was in college and couldn't understand this at all. but finally I understood this today. Thank you so much for simplifying.
My prof took 4 hours of my time to make me more confused. You sir, are a godsend! Please keep up the great work!
Dude you are freaking amazing. My professor could not explain this to me.
probably beçause ur prof landed some basics that u could understand this tutoriaal
@@youngk9026 Maynbe, but I'm off the opinion most professors suck at teaching, and don't care to improve. At least that describes most of the professors I had in undergrad and graduate school.
@@cjlooklin1914 i agree
@@cjlooklin1914my teachers are terrible!
+1
Wow, I came here in an attempt to understand FSM. I liked the video. Then I look at the comments, and WHOA! Everyone down here is so satisfied with how you put up the explanation. I couldn't agree less. Thank you very much sir!
Clear cut! Amazing stuff and definitely one of the best explanation I have ever seen.
I wish every professor was this good as teaching as you. Thanks.
I just was sure I will not understand it forever, until I watched ur video! thank u it's very clear and simple
Dude thank you! I was told I should learn what a FSM is so I understood what the basics of it was in the wiki page but I decided to watch a video and you explained it way more in-depth. Thank you :) you earned a subscriber :D
You are the real MVP, sir. keep doing thing like this
I was shown this concept when I was a neophyte software engineer writing real time control software for telecoms systems in the 1980s (OMG a lifetime ago). I made a point of explaining this concept to every software engineer who ever worked for me in the next 40 years because it is such a simple, powerful and MOST IMPORTANTLY for process control - completely bulletproof. If Every state deals with every event (including those it should never see) you cannot break these systems.
I wince at the lack of detailed understanding low level computer concepts in the 'Object oriented or nothing' - 'pythonesque' sofware developers I meet now. My degree is in Computer Science not Software engineering, and all we seem to train these days are 'coders' who barely warrant the title Software Engineer, as they understand few of the basic concept they're writing software on top of.
I wonder how many of them could write Assembler, or optimise some P-code. Not necessary, but a skill that gives an important insight into what the machine is doing when it runs lazily written bloatware.
Rant over :)
Thank you so much! Excellent and intuitive explanation, best I've ever come across actually.
I was confused whenever i thought how can Moore machine work without i/p when you mentioned "time" immediately I understood it works on "triggering"(in this case the triggering is time) beautiful explanation you have my gratitude for clearing my concept sir, thankyou
This is an outstanding brief. VERY WELL DONE. Clear, superb examples.
Thanks to you, now I understand how finite state machine works.
A very clear and straight to the point video, thanks!
Best explanation I ever heard for this topic
Thank you sir for taking the time to put this up. Very well done.
at 4:16 , how do you know which light get what input, why shouldn't you just put red as 10 or 01 instead of 00?
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".
Simply awesome with realistic examples. Sum up with the title of FSM was fascinating...
Thanks for this video! Amazing explanation of FSM in just 14 minutes!
Thank you, this video of yours is very helpful but I had a difficulty understanding the Mealy machine...
Brilliant! I got here after having a nightmare of a dream where I was presented a state machine in my Computer Engineering class and could not figure out what it was and my classmates understood it finished way ahead of me and me being the last one the professor yelling at me"what's taking so long dumba$$?" Now I am confident in can handle this in my dreams👍🏾🙌🏾🙏🏾
😂😂
Awesome . after seeing this video now i understood what is an fsm
Our professor move's through slides so quickly, you saved my lab report lol
Thank you Abelardo Pardo for your effort. I have understood better from your explanation, than learning from Zyante Zybook, a College assigned material.
Great explanation ! I can't figure it out when my teacher just told me to learn all by myself using those disgusting PDF
Finally a good explanation, thanks!
Wonderfully simple, yet complete lesson.
Very clear explanation, much better than my prof. Thanks :)
Thank You Professor Abelardo Pardo that is a great explanation it appears to me that there is 0 for open or null and a 1 for closed and positive while some are assigned not previously determined
How truck waiting signal is one when traffic is moving and trucks are going by? 6:53
Would it be possible for you to post another video about when we need Mealy and when we need Moore? Also the differences. Thanks ton anyways.
transmitting explanations from the moon hahah, thank you so much saved me so much headache
Great video !! Very simple and clean. Thanks!
best explanation yet. Thank you!
Crystal clear explanation, thank you very much!
Basic, Precise and straight forward.
Very well done presentation. Right to the point
That voice! It should be famous!
Thank you for such a great explanation...
Woah!!! This video really explained it very well! Amazing!!
Thnx for detailed explanation, this is amazing.
This video is very informative and concise!
my all concept are clear about FSM, thanks sir
Really clear and very helpful overview.
6:56 how can tR be 1 when trucks are waiting but then tR is also 1 when trucks are going?
tR is only 1 when the trucks are stopped. i believe the table is just laying out every possibility. if this were a real scenario i assume the trucks could still be waiting on Go if theres a huge traffic jam.
Abelardo you are a Legend
Hello sir, greetings. Please sir can you upload another video showing how it's being done using flip flops?
I don't understand, if the 1st Machine that you drew needed both the time input to be 1 AND the state to be xx, in order to change state, doesn't that mean that the output doesn't depend on the state rather than solely on input t? Am I missing something? Please correct me. Thank you.
+Mark Infinite Still looks like the output will regard both. The current state will not shift from green to red instantly nor will red switch to yellow regardless of the time input. Otherwise there would be no way to define the current state logically in the process in order for the timer to change it.
perhaps we don't consider time to be an input as such?
Woow, great job. Making whole lotta sense now
Very nice explanation thankyou :)
I don't understand the goal of a finite state machine, what about code implementation? A State machine use direct memory access or binary operations to evaluate it's next state, so how do you obtain that in your example?
Thank you so much, your explaining is very good, really thank you.
Thanks Bro, Now I understood, but I need to practice more
At 4:39 Can anyone explain how Red = 00, Green = 01 and Yellow = 10?
I can't understand how those values are chosen.
Thank you
They are assumptions.
Holy sh!t this is amazing... keep the good work, post more tutorials please :)
Well explained sir. Thank you!
the first example is great, but I get lost in the distracting traffic/pollution ....
Thank you bro, this is amazing! Had to see it twice to get the pollution part tho lol
Very clear and helpful. Thank you!
Thanks for the video. Is this a moore or a mealy machine?
if states are -x1, +x4, +x3 . what is the meaning of +ve -ve states in finite automata?
What have you based on to say to get a red light we have 00? Best regards.
I wish u would be my professor. Thank You very much!!!
Great explanation! Thank you sir!
Thankyu so much professor. very well explained
thank you for your clear explanations
Very well explained. Thanks!
So, a finite state machine an be defined in terms of a binary truth table? That reminds me of all the work I did in my Designing DIgital Systems class, although we didn't go over finite state machines.
but why the upper diagram is Moore? the output is influenced by the input t
Fantastic explanation
good explnation, thank you Abelardo
Thank you a lot! Very good explanation :)
Dear Mr. Abelardo Pardo, cold you help me ? I need project a FSM with follow fetures (2 bits machine, that recognize 1st sequence 0110, the output will be= 1, two sequences iquals 0110 0110, the 2nd the output, will be= 0, three sequences 0110 0110 0110, the 3r sequence output= 0) please how do I make this machine ? best regards. Paulo (Brazil)
The only minus point for this video is about the quality of sound! :(
+Trung Dũng Nguyễn Chào bạn..Bạn cũng đang nghiên cứu về cái này hả?
hi bạn, chỉ là phần mình học có liên quan thôi, chứ cũng không hẳn là nghiên cứu to tát gì :D
+Trung Dũng Nguyễn ohm tại mình đang làm đồ án về cái này tưởng bạn biết cho mình hỏi vài vấn đề á mà :)
hi bạn, bạn cứ hỏi đi, nếu mình biết mình sẽ trả lời :D
+Trung Dũng Nguyễn à mình đang làm về cái này mà tìm code trên mạng toàn là mạch 2 cột đèn...có bài giảng này 1 cột mà mình khó hiểu quá mình k viết code đc.Bạn có code cái này không cho mình tham khảo với.Cảm ơn bạn nhiều :)
Yes, that is a great explanation.
thank you sir! Was stuck in computing class
great explanation
Brilliant - well explained!
Thank you so much! Respect!
why yellow is 10 can you please explain
Excellent tutorial...
Gus Fring explains Finite State Machines
That was excellent, thank you!
thnx man!! Really helpful......
Thanks for the nice explanation
clean and clear at all...thanks
Great explanation sir. (y)
How to determine output considering input ?
Professor Pardo ?
Thanks for your effort.
nice video, thanks
Great! Thank you.
Nice, very helpful
Thank you!
nice explanation!
Great job! Thank you
Can you be my professor too LOL. This was so helpful, thank you!
So the top FSM is Moore? My professor said it was the other way around! Explains my quiz score.
yea, top fsm is Moore
Just remember "Moore is less." In other words, present state only. Mealy also includes input, the truck sensor in the case.
Thanks a lot professor.