Safe Haskell | None |
---|

The module provides implementation of *directed acyclic word graphs*
(DAWGs) also known as *minimal acyclic finite-state automata*.
The implementation provides fast insert and delete operations
which can be used to build the DAWG structure incrementaly.