Research any topic before you write.

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

Thompson's construction: Science, Overview & The algorithm

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.

Language: English [EN]
Use the mouse wheel or two fingers (on touchscreens) to zoom in and out of the map.
100%
More settings
100% 100% 100% 100% 100%

Thompson's construction topic overview

The analysis highlights Science, Overview and The algorithm as prominent areas in the source structure around Thompson's construction.

Related topics
19
Source areas
3
Connected nodes
22
Extracted relationships
18
Concept neighborhoods
14
Bridge connections
22

What this topic covers Research coverage

Source areas are shown by the number of related topics found in each part of the analysis. Use smaller areas too: they can reveal specialized angles and content gaps.

Overview · 14 topics
The algorithm · 3 topics
Relation to other algorithms · 2 topics

Smaller areas are not necessarily less important. They contain fewer connections in this analysis and can be useful for finding specialized angles or coverage gaps.

Explore all related topics Closing gaps

Browse the complete topic structure, not only the most central items. Less prominent entities and concepts can reveal missing angles, specialized context and useful research gaps. 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.

How Thompson's construction connects Entity context

The extracted context around Thompson's construction shows recurring relationship patterns in the source. For example, Thompson's construction → Converse, Glushkov's, Kleene's, McNaughton, NFAs, Thompson's, Yamada Another extracted example is Thompson's construction → Generating, NFA, Regular, This, Thompson's. Use these groups to spot repeated connection types before inspecting the individual relationships.

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

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

Thompson's construction relationships Subject–Predicate–Object triples

TTTA extracted 18 structured relationships around Thompson's construction. Examples in this analysis include Thompson's construction → related to Application of the algorithm → As and Thompson's construction → related to Application of the algorithm → Thompson's. The table shows each extracted connection, where it came from and its confidence.

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

The concept neighborhoods around Thompson's construction bring nearby vocabulary together. In this analysis, examples include Thompson's, Finite and Regular. Use the clusters to find adjacent concepts and terminology that may deserve separate research.

  • algorithm
    • Thompson's
    • Construction
    • Regular
    • Part
    • Expression
    • Finite
    • Automaton
    • Nfas
    • Nondeterministic
    • String
    • Subexpressions
    • Thompson
  • regular expression
    • Expressions
    • Nfa
    • Expression
    • Regular
    • Converted
    • Initial
    • Thompson's
    • State
    • Languages
    • Finite
    • Using
    • Nfas
  • regular languages
    • Expressions
    • Expression
    • Thompson's
    • Languages
    • Regular
    • Finite
    • Nfa
    • Better
    • Exactly
    • Nfas
    • Nondeterministic
    • Part
  • deterministic finite automaton
    • Powerset
    • Nondeterministic
    • Finite
    • Equivalent
    • Given
    • Thompson's
    • Deterministic
    • Construction
    • Expression
    • Two
    • Regular
    • Expressions
  • kleene's algorithm
    • Thompson's
    • Construction
    • Regular
    • Part
    • Expression
    • Finite
    • Automaton
    • Nfas
    • Nondeterministic
    • String
    • Subexpressions
    • Thompson
  • glushkov's construction algorithm
    • Thompson's
    • Construction
    • Regular
    • Finite
    • Expression
    • Part
    • Powerset
    • Deterministic
    • Equivalent
    • Given
    • Automaton
    • Nfa
  • the algorithm
    • Thompson's
    • Construction
    • Regular
    • Part
    • Expression
    • Finite
    • Automaton
    • Nfas
    • Nondeterministic
    • String
    • Subexpressions
    • Thompson
  • Thompson's construction
    • Thompson's
    • Finite
    • Regular
    • Expression
    • Powerset
    • Deterministic
    • Equivalent
    • Given
    • Nfa
    • Describe
    • Nondeterministic
    • Part

Connections between topic areas Semantic bridges

For Thompson's construction, one of the stronger structural bridges in this analysis connects Thompson's construction with Overview. Bridges highlight paths between different parts of the map and can reveal research angles that are easy to miss in a flat list.

Min side: 3
Thompson's construction — Overview · splits 8 ⟂ 15
Thompson's construction — The algorithm · splits 19 ⟂ 4
Thompson's construction — Relation to other algorithms · splits 20 ⟂ 3

Map overview Semantic statistics

Thompson's construction

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

Source & methodology

TTTA analyzes the structure around Thompson's construction to surface related topics, entities, relationships, concept neighborhoods and bridge connections. Use the map to explore areas such as Science, Overview & The algorithm, including less central topics that may reveal useful research gaps. Automatically extracted connections are research leads rather than rewritten encyclopedia content.

Source: Wikipedia — Thompson's construction · EN edition · Analysis: TopicsToTalkAbout

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