This chapter focused on understanding the basics of FSM, an algorithm that represents a computation model that simulates sequential logic.
We learned that this sequential logic is run by different states that the machine adopts and acts on accordingly, which is basically the pillar of our enemies' behavior.
As well as learning about the principles of finite-state machines, we have also looked at different real-life examples in order to understand the essence of this model. This is probably a new concept for us, so we want to make sure that we are able to hold on to this information, and most of all, that we are able to interpret the concept. This is why we learned how to create an FSM diagram of the traffic lights, Walkman, and washing machine FSM, as well as for other examples.
Finally, after all those concepts were good and fresh in our minds, we read about the...
