darrenregan / graph-theory---project Goto Github PK
View Code? Open in Web Editor NEWG00326934 - Graph Theory Project - build a non-deterministic finite automaton (NFA) from a regular expression, and can use the NFA to check if the regular expression matches any given string of text.