hDFA

hDFA provides a simple API for representing and minimizing deterministic finite automata (DFAs) using an explicit representation (a list of transitions). It includes a port of Antti Valmari's efficient DFA minimization algorithm from C++ to C. (See A. Valmari, Fast brief practical DFA minimization Information Processing Letters 112(6) 2012.)


Keywords
bsd3, data, library, Propose Tags , Data.DFA, Data.DFA.DOT, Data.DFA.KISS2, Data.DFA.STAMINA
License
BSD-3-Clause
Install
cabal install hDFA-0.0.2

Documentation

= hDFA: Simple deterministic finite automata =

hDFA provides a simple API for representing and minimizing
deterministic finite automata (DFAs) using an explicit representation
(a transition matrix). It includes a port of the Hopcroft minimization
algorithm in JFlex to C.

Building:

runghc Setup configure --user -p --enable-library-profiling --ghc-option=-auto-all --ghc-option=-caf-all
runghc Setup build
runghc Setup install

== Changes ==

0.0.2
  Add KISS2 and STAMINA support.
0.0.1
  Initial release