Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Add finite-state-machine topic #4613

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Add finite-state-machine topic #4613

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
13 changes: 13 additions & 0 deletions topics/finite-state-machine/index.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,13 @@
---
aliases: finite-state-machines, fsm, finite-state-automaton, finite-state-automata, finite-state-automatons, fsa, finite-automaton, finite-automata, finite-automatons, state-machine
display_name: Finite-state machine
related: automaton, deterministic-finite-automaton, nondeterministic-finite-automaton
short_description: A formalism consisting of a finite set of states and a transition function describing when to move from one state to another.
topic: finite-state-machine
wikipedia_url: https://en.wikipedia.org/wiki/Finite-state_machine
---
A **finite-state machine** (FSM), **finite-state automaton** (FSA), or simply **state machine** is a mathematical [model of computation](https://en.wikipedia.org/wiki/Model_of_computation) and an [abstract machine](https://en.wikipedia.org/wiki/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](https://en.wikipedia.org/wiki/Control_theory)), design of [hardware digital systems](https://en.wikipedia.org/wiki/Digital_electronics), [software engineering](https://github.com/topics/software-engineering), [compilers](https://github.com/topics/compiler), [network protocols](https://en.wikipedia.org/wiki/Network_protocol), and [computational linguistics](https://en.wikipedia.org/wiki/Computational_linguistics).
Loading