Thompson's construction

Thompson's construction

Common

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

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 computer science, Thompson's construction, also called the McNaughton–Yamada–Thompson algorithm, is a method of transforming a regular expression into an equivalent nondeterministic finite automaton (NFA). This NFA can be used to match strings against the regular expression.

Excerpt from the Wikipedia article “Thompson's construction”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Open free boosters and add Thompson's construction to your collection.

Play for free

Related cards