The Finite-state machine cardFinite-state machine

Finite-state machine

Rare

Rarity: Rare

A topic known well beyond its field, found in many languages.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Notion
Domain
Science and technology
In collections
Nobody has pulled it yet.

What Wikipedia says

In theoretical computer science, a finite-state machine (FSM) or finite-state automaton (FSA, plural: automata), finite automaton, or simply a state machine, is a mathematical model of computation. It is an abstract machine that can be in exactly one of a finite number of states at any given time.

Excerpt from the Wikipedia article “Finite-state machine”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Image: ManiacParisien, CC BY-SA 4.0, via Wikimedia Commons.

Open free boosters and add Finite-state machine to your collection.

Play for free

Related cards