Deterministic finite automaton

Rarity: Uncommon

A topic a little better known than average, read and translated beyond its own country.

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 the theory of computation, a branch of theoretical computer science, a deterministic finite automaton (DFA) is a finite-state machine that accepts or rejects a given string of symbols, by running through a state sequence uniquely determined by the string.

Excerpt from the Wikipedia article “Deterministic finite automaton”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Image: Self-made, Public domain, via Wikimedia Commons.