emito-k / thompsons-construction-on-nfas Goto Github PK
View Code? Open in Web Editor NEWThis project forked from niemaattarian/thompsons-construction-on-nfas
I was asked to write a Python program to execute regular expressions on strings using an algorithm known as Thompson's construction. In this, I have to build a non-deterministic finite automaton (NFA) from a regular expression, and can use this to check if the regular expression matches any given string text