DFASAT is now flexfringe!
DFASAT is Sicco Verwer’s competition winning implementation of an evidence-driven state-merging algorithm which features a reduction of the DFA identification problem to a SAT problem. The problem can be solved exactly using a solver like lingling, minisat, or glucose.
Newer versions of DFASAT are part of flexfringe. You can still access our old material, if you are explicitly interested in an older version:
- the repository is on bitbucket: https://bitbucket.org/chrshmmmr/dfasat
- a tutorial introduction to DFASAT, packaged in a virtual appliance running Ubuntu with all necessary libraries and tools installed and set up.
The tutorial still works with flexfringe, so check out our new page.