@hackage dawg0.3.0
Directed acyclic word graphs
Categories
License
BSD-3-Clause
Maintainer
waszczuk.kuba@gmail.com
Links
Versions
Installation
Dependencies (7)
- base >=4 && <5
- binary
- containers >=0.4.1 && <0.6
- monad-codec >=0.2 && <0.3
- mtl
- vector Show all…
Dependents (9)
@hackage/adict, @hackage/acme-everything, @hackage/polh-lexicon, @hackage/moan, @hackage/nerf, @hackage/hist-pl-fusion, Show all…
The library implements directed acyclic word graphs (DAWGs), which can be also interpreted as minimal acyclic finite-state automata.
In most cases you can use the Data.DAWG module which provides the basic
implementation of DAWGs. If values have substantial memory footprint
consider using the Data.DAWG.Wrapper module instead.