hDFA: A simple library for representing and minimising DFAs.
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.
Downloads
- hDFA-0.0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 0.0.1, 0.0.2 |
|---|---|
| Dependencies | base (>=2 && <5) [details] |
| License | LicenseRef-GPL |
| Copyright | 2010, 2011 Peter Gammie, some parts (C) 1998-2009 Gerwin Klein <lsf@jflex.de> |
| Author | Peter Gammie |
| Maintainer | peteg42@gmail.com |
| Category | Data |
| Uploaded | by PeterGammie at 2011-04-30T01:28:30Z |
| Distributions | |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Downloads | 1889 total (8 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs uploaded by user Build status unknown [no reports yet] |