Sign inSign in
ConceptEngineering

Finite state machine

A model of computation consisting of a set of states, a start state, an input alphabet, and a transition function that maps input and current states to a next state.
as Onur Mutlu defines itETH ZürichThe wording closest to all 6 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Boolean algebra2Sequential circuit2Binary logic1Combinational circuits1Digital logic1Python strings1Regular expressions1State1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

3

Each in their own terms, from the easiest level.

  • David J. Malan

    Harvard University · Introductory

    A machine of sorts, implemented in software, used to keep track of whether or not a user's email matches a pattern.
  • Onur Mutlu

    ETH Zürich · Undergraduate

    • 2:06Sequential Logic II, Labs, Verilog
    • 1:33:10Digital Design and Computer Architecture - L5: HDL, Verilog II, Timing & Verification
    • 46:19Digital Design and Computer Architecture: Problem Solving II (ETH Zürich, Spring 2025, Lecture 27)
  • Robert C. Martin

    Google Research & TechTalks · Undergraduate

    A computational model with a fixed number of states and transitions triggered by inputs, implemented mechanically in early computing.
    • 11:53Clean Code III: Functions

Lectures that assume it

13

The first 12 are shown.

Connections

26

The lectures that define it or assume it, and the concepts next to it.

Concepts7

Show 1 more

Lectures19

Show 13 more

3 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.