Thompson's algorithm

E162099 UNEXPLORED

Thompson's algorithm is a classic computer science method for converting regular expressions into nondeterministic finite automata (NFAs), widely used in pattern matching and lexical analysis.

Jump to: Surface forms Referenced by

Observed surface forms (2)

Surface form	Occurrences
Thompson's construction	1
Thompson's construction for converting regular expressions to NFAs	1

Referenced by (3)

Full triples — surface form annotated when it differs from this entity's canonical label.

Ken Thompson → developed → Thompson's algorithm ⓘ

this entity surface form: Thompson's construction

Ken Thompson → knownFor → Thompson's algorithm ⓘ

this entity surface form: Thompson's construction for converting regular expressions to NFAs