TU/e EE Notes

Home

❯

Topics

❯

Finite State Machines and Automata

Finite State Machines and Automata

Oct 03, 20261 min read

Models with a finite number of states that change on inputs. Used to design sequential hardware and, as automata, to describe formal languages and check properties.

Area: Computer Engineering

Covered in

  • 5EIB0 Computation II: Finite-State Machines
  • 5EIB0 Computation II, resit notes: Finite State Machine (resit) - 5EIB0
  • 5XIE0 Computation Modeling: Finite Automata A.2.2, Büchi Automata A.4.2

Related topics

Digital Logic · Hardware Description Languages and FPGAs


Edit this page on GitHub · History

Graph View

  • Covered in
  • Related topics

Backlinks

  • Computation II - 5EIB0
  • Finite State Machine (resit) - 5EIB0
  • Computation Modeling - 5XIE0
  • Computer Engineering
  • Digital Logic
  • Hardware Description Languages and FPGAs

Created with Quartz v4.5.2 © 2026

  • Source on GitHub
  • How to contribute