hDFA: A simple library for representing and minimising DFAs.

[ bsd3, data, library ] [ Propose Tags ]

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.)


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


  • 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
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 1906 total (6 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]