Introduction - If you have any usage issues, please Google them yourself
Java implementation of finite automata related functions toolkit includes: transformation between regular expression, NFA and DFA. The intersect, complement, substract and union operation of DFA. Judge whether the corresponding regular sets of a DFA is an infinite set. Lists all the strings contain in a finite regular set, and calculate the minimum and maximum length of the strings contains. Determine whether the two minimized DFA equivalence or not, and so on.
Code is open source: https://a1e2w3 @ bitbucket.org/a1e2w3/dfa4java.git