Count reachable states instead of ingoing paths

kawu / dawg

Directed acyclic word graphs

BSD 2-Clause "Simplified" License

11 stars 1 forks source link

Count reachable states instead of ingoing paths #2

Closed kawu closed 11 years ago

kawu commented 11 years ago

DAWG tracks numbers of ingoing paths for each node in the automaton. It should track numbers of reachable final states instead. It will allow to use DAWG as a perfect hash automaton.