Skip to content

What's FSA?

Jump to bottom
pavl_g edited this page Aug 9, 2023 · 5 revisions

Finite-State-Automaton is a sequential states of logic, between each 2 states, a transition exists, a transition defines transiting from state A to state B, each state processes an input (associated with the transition) and is capable of producing an output (defined by the present-state).

Here is a simple diagram describing a Finite-State-Automaton in action, this is a deterministic FSA (each state accepts only and only one successor transition):

Finite-State-Automaton Components:

  • A Transition: composed of a present state, a next state and an input value aka. the successor value or the transition value.

  • A Transitional Manager: manages and handles the transition paths in a FSA environment.

  • Transitional Listeners: embedded Command-State pattern to inject some actions in-between the FSA transitions, this pattern can assign new transitions to the system.

Note: FSA is an abstract concept and can be applied to any type of logic (e.g, GUI - Embedded Systems - Game Engines - Compilers).

Clone this wiki locally