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.
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
3Each in their own terms, from the easiest level.
David J. Malan
A machine of sorts, implemented in software, used to keep track of whether or not a user's email matches a pattern.Onur Mutlu
Robert C. Martin
A computational model with a fixed number of states and transitions triggered by inputs, implemented mechanically in early computing.
Lectures that assume it
13The first 12 are shown.
- Problem Solving V: Digital Design and Computer Architecture (ETH Zürich, Spring 2025, Lecture 30)
- Digital Design and Computer Architecture: Problem Solving IV (ETH Zürich, Spring 2025, Lecture 29)
- Von Neumann Model & Instruction Set Architectures
- Venturing out into the world with AI
- Virtual Memory (ETH Zürich: Digital Design and Computer Architecture, Lecture 24)
- Digital Design and Computer Architecture: Problem Solving VI (ETH Zürich, Spring 2025, Lecture 31)
- Digital Design and Computer Architecture - L4: Sequential Logic II, Labs, Verilog
- ISA and Microarchitecture
- Multi-Cycle and Pipelined Processor Design
- GSQ-RCO: Better Non-Uniform GGUF Quantization
- Instruction Set Architectures II
- Digital Design and Computer Architecture: Problem Solving I (ETH Zürich, Spring 2025, Lecture 26)
Connections
26The lectures that define it or assume it, and the concepts next to it.
Concepts7
Show 1 moreShow fewer
Lectures19
- Digital Design and Computer Architecture - L3: Sequential Logic
- Regular Expressions
- Sequential Logic II, Labs, Verilog
- Digital Design and Computer Architecture - L5: HDL, Verilog II, Timing & Verification
- Digital Design and Computer Architecture: Problem Solving II (ETH Zürich, Spring 2025, Lecture 27)
- Clean Code III: Functions
Show 13 moreShow fewer
- Problem Solving V: Digital Design and Computer Architecture (ETH Zürich, Spring 2025, Lecture 30)
- Digital Design and Computer Architecture: Problem Solving IV (ETH Zürich, Spring 2025, Lecture 29)
- Von Neumann Model & Instruction Set Architectures
- Venturing out into the world with AI
- Virtual Memory (ETH Zürich: Digital Design and Computer Architecture, Lecture 24)
- Digital Design and Computer Architecture: Problem Solving VI (ETH Zürich, Spring 2025, Lecture 31)
- Digital Design and Computer Architecture - L4: Sequential Logic II, Labs, Verilog
- ISA and Microarchitecture
- Multi-Cycle and Pipelined Processor Design
- GSQ-RCO: Better Non-Uniform GGUF Quantization
- Instruction Set Architectures II
- Digital Design and Computer Architecture: Problem Solving I (ETH Zürich, Spring 2025, Lecture 26)
- Cognitive Architectures: GPS, SOAR, Subsumption & The Society of Mind