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 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.)
Downloads
- hDFA-0.0.2.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), containers, directory, process [details] |
| License | BSD-3-Clause |
| Copyright | 2010-2012 Peter Gammie, original minimisation algorithm implementation in C++ (C) Antti Valmari 2011 |
| Author | Peter Gammie |
| Maintainer | peteg42@gmail.com |
| Category | Data |
| Source repo | head: git clone git://github.com/peteg/hDFA.git |
| Uploaded | by PeterGammie at 2012-06-15T03:39:46Z |
| Distributions | |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Downloads | 1939 total (2 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] |