Safe Haskell | Safe-Infered |
---|

An interface to the Berkeley/Colorado STAMINA tool.

STAMINA minimizes the number of states in an under-specified finite state automata. This problem is NP-complete in general (unlike the problem solved by Hopcroft's algorithm and its modern descendants.).

It is part of Berkeley's SIS distribution: http://embedded.eecs.berkeley.edu/pubs/downloads/sis/index.htm