Lesson 24 — Finite State Machines I#
Sequential versus combinational logic, Moore versus Mealy, diagrams and transition tables.
Objectives covered
2.8 — I can model Moore and Mealy Finite State Machines (FSMs) using tools such as state transition diagrams, transition tables, and combinational and sequential logic circuits.
Due at this lesson
Quiz 6 (Obj 2.5–2.6)
Reading
Finite State Machines
The course reading for Objective 2.8.
FlashcardsReview deck
Key terms, equations, and ideas from this lesson, in a self-test deck.
SlidesLesson 24 deck
The slides used in class, as a PDF.
Practice ProblemsWork these before the quiz
Ungraded problems with answers, on the downloads page.
Demo ↗FSM Explorer
Build, edit, and step through finite-state machines visually.