Skip to content
#

fsm

A finite-state machine (FSM), finite-state automaton (FSA), or simply state machine is a mathematical model of computation and an abstract machine that can be in exactly one of a finite number of states at any given time.

The FSM can change from one state to another in response to some inputs; the change from one state to another is called a transition.

An FSM is defined by a list of its states, its initial state, and the inputs that trigger each transition.

In computer science, FSM are widely used in modeling of application behavior (control theory), design of hardware digital systems, software engineering, compilers, network protocols, and computational linguistics.

Here are 75 public repositories matching this topic...

The core system uses a Finite State Machine (FSM) to handle sequential serial protocols. By passing system parameters, the architecture recalculates internal counters to support variable bandwidths (9600, 115200, and 1 Mbps). It is mapped to run on standard FPGA boards (such as Basys 3 or Nexys A7) driven by a 100 MHz onboard crystal oscillator.

  • Updated Mar 26, 2026
  • Verilog