Directed acyclic word graphs
|Version on this page:||0.5.1.0|
|LTS Haskell 20.23:||0.5.1.2|
|Stackage Nightly 2023-05-01:||0.5.1.2|
|Latest on Hackage:||0.5.1.2|
Maintained by firstname.lastname@example.org
This version can be pinned in stack with:
Module documentation for 0.5.1.0
The library implements directed acyclic word graphs (DAWGs) internally represented as minimal acyclic deterministic finite-state automata. The implemented version of DAWG can be seen as a map from sequences of alphabet symbols (keys) to values.
The library allows to build DAWGs over any symbols and values
provided that they both have
Ord instances (see the
It also provides a fast insert operation which can be used to
construct DAWGs on-the-fly.