Regular Expression to NFA to DFA
-
Implemented Thompson's construction to transform regular expression to NFA
-
Converted NFA to DFA through Breath-First-Search(BFS) algorithm
-
Verified whether two given regular expressions are identical by checking the existence of shortest Path of $$ NFA1 - NFA2 $$