Nondeterministic 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 automata theory, a finite-state machine is called a deterministic finite automaton (DFA), if

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

Image: Niels Mündler, CC0, via Wikimedia Commons.