Research any topic before you write.

Find related topics. | Discover entities. | See connections. | Build a topical map.

Thompson's construction

In computer science, Thompson's construction algorithm, 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. This algorithm is credited to Ken Thompson.

Science, Overview & The algorithm

Use the mouse wheel or two fingers (on touchscreens) to zoom in and out of the map.

Research this topic

Explore the main themes, entities and connections around Thompson's construction. Start with the topic map, then use the sections below for research and deeper semantic analysis.

Explore this topic

Start with a few of the strongest sections from the source topic. These are research directions, not a list of keywords you must use.

Topics to explore

Browse the full topic structure. Each item opens a new analysis centered on that subject.

Overview

The algorithm

Relation to other algorithms

Advanced semantic analysis

Deeper signals for content research, entity SEO and topical coverage. The plain-language headings explain what each technical view is useful for.

Map overview Semantic statistics

Thompson's construction

Nodes23
Edges22
Triples18
Avg. degree1.91
Density0.086957
Components1

How this topic connects Entity context

See the strongest relationship patterns around the current topic before diving into the raw triples.

Thompson's construction

Top relations

related to Relation to other algorithms · 7
Thompson's construction → Converse, Glushkov's, Kleene's, McNaughton, NFAs, Thompson's, Yamada
related to Use in string pattern matching · 5
Thompson's construction → Generating, NFA, Regular, This, Thompson's
related to Application of the algorithm · 4
Thompson's construction → An, As, The, Thompson's
related to Small Example · 2
Thompson's construction → The, Thompson's

Important terminology Word statistics

Use these terms to understand the vocabulary surrounding the topic, not as a checklist for keyword stuffing.

Important terminology

regular expression algorithm nfa state thompson's construction automaton expressions finite converted two languages initial final equivalent given states thompson nondeterministic

Entity relationships Subject–Predicate–Object triples

SubjectPredicateObjectConfidenceSrc
Thompson's constructionrelated to Application of the algorithmAs0.60section
Thompson's constructionrelated to Application of the algorithmThompson's0.60section
Thompson's constructionrelated to Application of the algorithmThe0.60section
Thompson's constructionrelated to Application of the algorithmAn0.60section
Thompson's constructionrelated to Relation to other algorithmsThompson's0.60section
Thompson's constructionrelated to Relation to other algorithmsNFAs0.60section
Thompson's constructionrelated to Relation to other algorithmsMcNaughton0.60section
Thompson's constructionrelated to Relation to other algorithmsYamada0.60section
Thompson's constructionrelated to Relation to other algorithmsConverse0.60section
Thompson's constructionrelated to Relation to other algorithmsKleene's0.60section
Thompson's constructionrelated to Relation to other algorithmsGlushkov's0.60section
Thompson's constructionrelated to Small ExampleThe0.60section

Related concept clusters Concept neighborhoods

These clusters group vocabulary that occurs around closely connected concepts in the source material.

    Connections between topic areas Semantic bridges

    Bridges can reveal useful research angles that are easy to miss in a flat list of related terms.

    Min side: 3
    For writers, content strategists, SEOs, marketers and creators — from quick topic research to advanced semantic analysis.