I am look for a tool with any or all of the following features:

  1. Regular Expresstion to NFA converter that represents transitions as Binary Decision Diagrams
  2. NFA to DFA converter
  3. NFA minimization
  4. NFA union/complement/intersection

Can you recommend one?

  • 1
    $\begingroup$ @D.W. Actually, in case of scientific software, the last consensus on meta.cs seems to be that this question was actually OK (if the "widely used" is dropped from the question): cs.stackexchange.com/questions/87756/… $\endgroup$ – DCTLib Feb 6 '18 at 11:05
  • 1
    $\begingroup$ @DCTLib, OK, I've re-opened it. Thank you! (I'm guessing you meant to link to cs.meta.stackexchange.com/q/660/755 or cs.meta.stackexchange.com/q/473/755.) However, requests for "your favorite [anything]" are not suitable here (it's one of the bullet items in our help center), so I've edited this to focus on the specific requirements identified by the poster. $\endgroup$ – D.W. Feb 6 '18 at 13:03
  • $\begingroup$ I agree; this should be closed as "opinion based" or "offtopic". Without criteria what makes a tool suitable, we have an open-ended list question here, full of non-CS answers. (cc @D.W. ) $\endgroup$ – Raphael Feb 6 '18 at 21:29

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.