It probably comes down to "regexes" vs actual Regular Expressions. Thompson NFAs represent actual, textbook Regular Expressions (the definition of a Regular Expression is "can be implemented as finite ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback