Thompson's construction converts a regex to an NFA using ε-transitions. States are shown as nodes; ε-transitions shown as dashed arrows. Simulate string matching step by step.
Enter a regex and test string, then Build NFA
Pattern:Test:
Examples:
Normal stateActive (simulation)Accept stateε-transition