I developed this project because of our automata theory lesson. First of all we convert the given regex to dfa.We are using syntax tree during the conversion process(Conversion from regex to dfa was taken from alirezakay's repo).Then we produce words suitable for the alphabet and check them on dfa. We list the appropriate ones.
I did write more explanation on my own site. You can check my writing on here
Projects have MIT License.
Feel free to send us feedback on E-mail or Linkedin.Feature requests are always welcome. If you wish to contribute its free to open