Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the basics of finite state machines, including sequential and combinatorial systems, Boolean algebra, state diagrams, and transition logic. It also delves into the design aspects of FSMs, such as memory elements, transition-logic, and output-logic. The instructor explains the concepts using examples like Medvedev and Moore FSMs, along with practical applications like decoders and encoders.