Data.DFA.STAMINA

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

Documentation

minimize :: FilePath -> DFA -> IO DFA

Minimize an automaton using STAMINA.

The first argument is the path to STAMINA.

FIXME This creates a new DFA (it really shouldn't). It inherits the debugging setting from the argument DFA.